Constraint deduction in an interval-based temporal logic

  • Jana Koehler
  • Ralf Treinen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 897)


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.


Modal Logic Temporal Logic Predicate Symbol Sequent Calculus Temporal Abstraction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aba89]
    Martin Abadi. The power of temporal proofs. Theoretical Computer Science, 65:35–83, 1989.Google Scholar
  2. [Bau92]
    Mathias Bauer. An interval-based temporal logic in a multivalued setting. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction (CADE'11), LNCS 607, pages 355–369, Saratoga Springs, NY,USA, 1992. Springer.Google Scholar
  3. [BBD+93]
    Mathias Bauer, Susanne Biundo, Dietmar Dengler, Jana Koehler, and Gabriele Paul. PHI — a logic-based tool for intelligent help systems. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chambery, France, 1993.Google Scholar
  4. [BDK92]
    Susanne Biundo, Dietmar Dengler, and Jana Koehler. Deductive planning and plan reuse in a command language environmen. In Proceedings of the 10th European Conference on Artificial Intelligence, pages 628–632, 1992.Google Scholar
  5. [Bib86]
    Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115–132, 1986.Google Scholar
  6. [Bür91]
    Hans-Jürgen Bürckert. A Resolution Principle for a Logic with Restricted Quantifiers. Lecture Notes in Artificial Intelligence, vol. 568. Springer, 1991.Google Scholar
  7. [Den94]
    Dietmar Dengler. An adaptive deductive planning system. In A. Cohn, editor, Proceedings of the 11th European Conference on Artificial Intelligence, pages 610–614, Amsterdam, NL, August 1994. John Wiley & Sons.Google Scholar
  8. [FO92]
    Michael Fisher and Richard Owens. From the past to the future: Executing temporal logic programs. In A. Voronkov, editor, Proceedings of the International Conference on Logic Programming and Automated Reasoning (LPAR'92), pages 369–380. Springer, Berlin, Heidelberg, 1992.Google Scholar
  9. [Fri91]
    Alan M. Frisch. The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence, 49:161–198, 1991.Google Scholar
  10. [FS91]
    Alan M. Frisch and Richard R. Scherl. A general framework for modal deduction. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd Conference on Principles of Knowledge Representation and Reasoning (KR'9I), pages 196–207, Cambridge,Massachusetts, 1991. Morgan Kaufmann.Google Scholar
  11. [Gab89]
    Dov Gabbay. Declarative past and imperative future: Executable temporal logic for imperative systems. In H. Barringer and A. Pnueli, editors, Proceedings of the Colloquium on Temporal Logic in Specification 1987, LNCS 398, pages 402–450, Altrincham, 1989. Springer.Google Scholar
  12. [Hal87]
    Roger Hale. Temporal logic programming. In A. Galton, editor, Temporal Logics and Their Applications, pages 91–119. Academic Press, 1987.Google Scholar
  13. [Koe94a]
    Jana Koehler. An application of terminological logics to case-based reasoning. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, pages 351–362. Morgan Kaufmann, San Francisco, CA, 1994.Google Scholar
  14. [Koe94b]
    Jana Koehler. Avoiding pitfalls in case-based planning. In Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, pages 104–109, Chicago, IL, 1994. AAAI Press, Menlo Park.Google Scholar
  15. [Krö87]
    Fred Kroger. Temporal Logic of Programs. Springer, Heidelberg, 1987.Google Scholar
  16. [MM83]
    Ben Moszkowski and Zohar Manna. Reasoning in interval temporal logic. In E. Clarke and D. Kozen, editors, Proceedings of the Conference on Logics of Programs, LNCS 164. Springer, 1983.Google Scholar
  17. [MW87]
    Zohar Manna and Richard Waldinger. How to clear a block: Plan formation in situational logic. Journal of Automated Reasoning, 3:343–377, 1987.Google Scholar
  18. [Ohl91]
    Hans-Jürgen Ohlbach. Semantics-based translation methods for modal logics. Journal of Logic and Computation, 1(5):691–775, 1991.Google Scholar
  19. [Rab69]
    Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1–35, 1969.Google Scholar
  20. [RP86]
    Roni Rosner and Amir Pnueli. A choppy logic. In Symposium on Logic in Computer Science, Cambridge, Massachusetts, 1986.Google Scholar
  21. [SH88]
    Andrzej Szalas and Leszek Holenderski. Incompleteness of first-order temporal logic with until. Theoretical Computer Science, 57:317–325, 1988.Google Scholar
  22. [Sza86]
    Andrzej Szalas. Concerning the semantic consequence relation in first-order temporal logic. Theoretical Computer Science, 47:329–334, 1986.Google Scholar
  23. [Sza87]
    Andrzej Szalas. A complete axiomatic characterization of first-order temporal logic of linear time. Theoretical Computer Science, 54:199–214, 1987.Google Scholar
  24. [Tre92]
    Ralf Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14(5):437–457, November 1992.Google Scholar
  25. [Wal89]
    Lincoln A. Wallen. Automated Deduction in Nonclassical Logics. MIT Press, Cambridge, London, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jana Koehler
  • Ralf Treinen

There are no affiliations available

Personalised recommendations