A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Constraint deduction in an interval-based temporal logic
[chapter]
1995
Lecture Notes in Computer Science
We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism.
doi:10.1007/3-540-58976-7_7
fatcat:loa4rzzrs5djpdhbjm6pjra5oi