Article

A resolution method for temporal logic

Author:

IJCAI'91: Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Pages 99 - 104

Published: 24 August 1991 Publication History

Abstract

In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method is based on classical resolution, but incorporates a temporal resolution rule that can be implemented efficiently using a graph-theoretic approach.

References

[1]

[Abadi and Manna, 1990] M. Abadi and Z. Manna. Nonclausal Deduction in First-Order Temporal Logic. ACM Journal, 37(2):279-317, April 1990.

Crossref

Google Scholar

[2]

[Banieqbal and Barringer, 1989] B. Banieqbal and H. Barringer. Temporal Logic with Fixed Points. In Proceedings of the Colloquium on Temporal Logic and Specification (LNCS Vol. 398), pages 62-74, Altrincham, U.K., 1989. Springer-Verlag.

Crossref

Google Scholar

[3]

[Barringer et al., 1989] H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. METATEM: A Framework for Programming in Temporal Logic. In REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (LNCS Volume 430), pages 94-129, Mook, Netherlands, June 1989. Springer Verlag.

Crossref

Google Scholar

[4]

[del Cerro, 1984] Luis Fanftas del Cerro. Resolution Modal Logics. In Proceedings of Advanced NATO Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, pages 46-78, La Colle-sur-Loup, France, October 1984.

Google Scholar

[5]

[Enjalbert and del Cerro, 1989] P. Enjalbert and L. Farinas del Cerro. Modal Resolution in Clausal Form. Theoretical Computer Science, 65:1-33,1989.

Digital Library

Google Scholar

[6]

[Fisher and Noel, 1990] Michael D. Fisher and Philippe A. Noel. Transformation Rules for METATEM Programs. METATEM project report, Department of Computer Science, University of Manchester, May 1990. (Draft).

Google Scholar

[7]

[Gabbay, 1987] D. Gabbay. Modal and Temporal Logic Programming. In A. Galton, editor, Temporal Logics and their Applications, pages 121-168. Academic Press, 1987.

Crossref

Google Scholar

[8]

[Gabbay, 1989] D. Gabbay. Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proceedings of Colloquium on Temporal Logic in Specification (LNCS Volume 398), pages 402-450, Altrincham, U.K., 1989. Springer-Verlag.

Crossref

Google Scholar

[9]

[Ohlbach, 1988] Hans-Jurgen Ohlbach. A Resolution Calculus for Modal Logics. Lecture Notes in Computer Science, 310:500-516, May 1988.

Crossref

Google Scholar

[10]

[Sakuragawa, 1986] T. Sakuragawa. Temporal Prolog. Technical report, Research Institute for Mathematical Sciences, Kyoto University, 1986. to appear in Computer Software.

Google Scholar

[11]

[Vardi and Wolper, 1986] Moshe Y. Vardi and Pierre Wolper. Automata-theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences, 32(2): 183-219, April 1986.

Digital Library

Google Scholar

[12]

[Venkatesh, 1986] G. Venkatesh. A Decision Method for Temporal Logic based on Resolution. Lecture Notes in Computer Science, 206:272-289,1986.

Crossref

Google Scholar

[13]

[Wolper, 1982] P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.

Digital Library

Google Scholar

[14]

[Wolper, 1985] Pierre Wolper. The Tableau Method for Temporal Logic: An overview. Logique et Analyse, 110-111:119-136, June-Sept 1985.

Google Scholar

Cited By

View all

Fionda VGreco G(2018)LTL on finite and process tracesJournal of Artificial Intelligence Research10.1613/jair.1.1125663:1(557-623)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1613/jair.1.11256
Schuppan V(2016)Enhancing unsatisfiable cores for LTL with information on temporal relevanceTheoretical Computer Science10.1016/j.tcs.2016.01.014655:PB(155-192)Online publication date: 6-Dec-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.01.014
Schuppan V(2016)Extracting unsatisfiable cores for LTL via temporal resolutionActa Informatica10.1007/s00236-015-0242-153:3(247-299)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00236-015-0242-1
Show More Cited By

A resolution method for temporal logic
1. Theory of computation
  1. Logic

Recommendations

A resolution method for CTL branching-time temporal logic
TIME '97: Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)

We extend our clausal resolution method for linear temporal logics to a branching-time framework. The branching-time temporal logics considered are computation tree logic (CTL), often regarded as the simplest useful logic of this class, and extended CTL ...
Resolution proof technique in linear temporal logic
Invariant-Free Clausal Temporal Resolution

Resolution is a well-known proof method for classical logics that is well suited for mechanization. The most fruitful approach in the literature on temporal logic, which was started with the seminal paper of M. Fisher, deals with Propositional Linear-...

Comments

Information & Contributors

Information

Published In

IJCAI'91: Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

August 1991

603 pages

ISBN:1558601600

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 24 August 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fionda VGreco G(2018)LTL on finite and process tracesJournal of Artificial Intelligence Research10.1613/jair.1.1125663:1(557-623)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1613/jair.1.11256
Schuppan V(2016)Enhancing unsatisfiable cores for LTL with information on temporal relevanceTheoretical Computer Science10.1016/j.tcs.2016.01.014655:PB(155-192)Online publication date: 6-Dec-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.01.014
Schuppan V(2016)Extracting unsatisfiable cores for LTL via temporal resolutionActa Informatica10.1007/s00236-015-0242-153:3(247-299)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00236-015-0242-1
Artale AKontchakov RRyzhikov VZakharyaschev M(2014)A Cookbook for Temporal Conceptual Data Modelling with Description LogicsACM Transactions on Computational Logic10.1145/262956515:3(1-50)Online publication date: 25-Jul-2014
https://dl.acm.org/doi/10.1145/2629565
Bresolin DMuñoz-Velasco ESciavicco G(2014)Sub-propositional Fragments of the Interval Temporal Logic of Allen's RelationsProceedings of the 14th European Conference on Logics in Artificial Intelligence - Volume 876110.1007/978-3-319-11558-0_9(122-136)Online publication date: 24-Sep-2014
https://dl.acm.org/doi/10.1007/978-3-319-11558-0_9
Gaintzarain JLucio P(2013)Logical foundations for more expressive declarative temporal logic programming languagesACM Transactions on Computational Logic10.1145/252893114:4(1-41)Online publication date: 28-Nov-2013
https://dl.acm.org/doi/10.1145/2528931
Konur S(2013)A survey on temporal logics for specifying and verifying real-time systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-013-2195-27:3(370-403)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1007/s11704-013-2195-2
Gaintzarain JHermo MLucio PNavarro MOrejas F(2007)A cut-free and invariant-free sequent calculus for PLTLProceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic10.5555/2392389.2392435(481-495)Online publication date: 11-Sep-2007
https://dl.acm.org/doi/10.5555/2392389.2392435
Fisher M(2005)Implementing temporal logicsProceedings of the 6th international conference on Computational Logic in Multi-Agent Systems10.1007/11750734_8(129-142)Online publication date: 27-Jun-2005
https://dl.acm.org/doi/10.1007/11750734_8
Konev BWolter FZakharyaschev M(2005)Temporal logics over transitive statesProceedings of the 20th international conference on Automated Deduction10.1007/11532231_14(182-203)Online publication date: 22-Jul-2005
https://dl.acm.org/doi/10.1007/11532231_14
Show More Cited By

Abstract

References

Cited By

Recommendations

A resolution method for CTL branching-time temporal logic

Resolution proof technique in linear temporal logic

Invariant-Free Clausal Temporal Resolution

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations