Efficient loop-check for backward proof search in some non-classical propositional logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1071, Issue , 1996, Pages 210-225

  Heuerding, Alain ^a   Seyfried, Michael ^a   Zimmermann, Heinrich ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); PATHOLOGY; SEMANTICS; THEOREM PROVING;

BRANCHING DEGREE; CLASSICAL PROPOSITIONAL LOGIC; INTUITIONISTIC LOGIC; ITS APPLICATIONS; KRIPKE SEMANTICS; NON TERMINATIONS; PROOF SEARCH; SEQUENT CALCULUS;

FORMAL LOGIC;

EID: 84958951660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_14     Document Type: Conference Paper

References (16)

1. Brian F. Chellas. Modal logic: an introduction. Cambridge University Press, 1980.
2. Roy Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. The Journal of Symbolic Logic, 57(3):795-807, 1992.
3. Melvin Fitting. Proof Methods for Modal and Intuitionistie Logics. Reidel, Dordrecht, 1983.
4. Melvin Fitting. Basic modal logic. In Dov M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, pages 368-448. Clarendon Press, Oxford, 1993.
5. D M Gabbay. Algorithmic Proof with Diminishing Resources Part 1. In E. BSrger, editor, CSL 90, LNCS 533, pages 156-173, 1991.
6. Rajeev Goré Tableau methods for modal and temporal logics. Technical report, TR-15-95, Automated Reasoning Project, Australian National University, Canberra, Australia, 1995. To appear in Handbook of Tableau Methods, Kluwer, 1997.
7. Rajeev Goré, Wolfgang Heinle, and Alain Heuerding.: Relations between propositional normal modal logics: an overview. Technical report, TR-16-95, Automated Reasoning Project, Australian National University, Canberra, Australia, 1995.
8. Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, and Michael Seyfried. Propositional logics on the computer. In Peter Baumgartner, Reiner Hs and Joachim Posegga, editors, Theorem Proving with Analytic Tableaux and Related Methods, LNCS 918, pages 310-323, 1995.
9. Järg Hudelmaier. An O(n log n)-space decision procedure for intuitionistic propositional logic. Journal of Logic and Computation, 3(1):63-75, 1993.
10. Järg Hudelmaier. On a contraction free sequent calculus for the modal logic S4. In TABLEAUX 94. 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 1994.
11. S.C. Kleene. Introduction to Metamathematics. North-Holland, Amsterdam, 1952.
12. Richard E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3):467-480, 1977.
13. LWBtheory. http://lwbwww.unibe.ch: 8080/LWBtheory.html, 1995.
14. Nicholas Rescher and Alasdair Urquhart. Temporal Logic. Springer, 1971.
15. Michael Seyfried. A sequent calculus for proof search in the (→ ⋀)-fragment of intuitionistic logic. Unpublished, 1994.
16. Heinrich Zimmermann. A directed tree calculus for minimal tense logic. Master’s thesis, IAM, University of Berne, Switzerland, 1995.