Clausal Temporal Resolution

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages, 0 figures Expanded related work, corrected typos, expanded proofs

Scientific paper

In this article, we examine how clausal resolution can be applied to a specific, but widely used, non-classical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples and examine the correctness and complexity of this approach is examined and. This clausal resolution approach. Finally, we describe related work and future developments concerning this work.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Clausal Temporal Resolution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clausal Temporal Resolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clausal Temporal Resolution will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-361151

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.