Constraint deduction in an interval-based temporal logic [chapter]

Jana Koehler, Ralf Treinen
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