Constraint Deduction in an Interval-based Temporal Logic

Jana Koehler & Ralf Treinen

In this paper, reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop are described. A constraint deduction approach is proposed and compared with a sequent calculus which has been developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.