On the modal logic K plus theories

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

Volumn 1092, Issue , 1996, Pages 308-319

  Heuerding, Alain ^a   Schwendimann, Stefan ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; RECONFIGURABLE HARDWARE;

COUNTER-MODELS; DECISION PROCEDURE; FINITE SET; MODAL LOGIC; PROOF SEARCH;

COMPUTER CIRCUITS;

EID: 0342672918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_45     Document Type: Conference Paper

References (14)

1. Laurent Catach. Tableaux: A general theorem prover for modal logics. Journal of Automated Reasoning, 7:489-510, 1991.
2. Melvin Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, 1983.
3. Melvin Fitting. First-order modal tableaux. Journal of Automated Reasoning, 4:191-213, 1988.
4. 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, 199?
5. Rajeev Goré, Wolfgang Heinle, and Alain Heuerding. Relations between propositional normal modal logics: an overview. Submitted.
6. Joseph Y. Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
7. Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, and Michael Seyfried. Propositional logics on the computer. In Theorem Proving with Analytic Tableaux and Related Methods, LNCS 918, 1995.
8. Richard E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3):467-480, 1977.
9. Ilkka Niemelä and Heikki Tuominen. Helsinki logic machine: A system for logical expertise. Technical report, Digital Systems Laboratory, Department of Computer Science, Helsinki University of Technology, 1987.
10. F. Oppacher and E. Suen. Harp: A tableau-based theorem prover, Journal of Automated Reasoning, 4:69-100, 1988.
11. Dan Sahlin, Torkel Franzén, and Self Haridi. An intuitionistic predicate logic theorem prover. Journal of Logic and Computation, 2(5):619-656, 1992.
12. Kurt Schütte. Vollständige Systeme modaler und intuitionistischer Logik. Springer, 1968.
13. Alasdalr Urquhart. Complexity of proofs in classical propositional logic. In Yiannis N. Moschovakis, editor, Logic from Computer Science, pages 597-608. Springer, 1992.
14. Lincoln Wallen. Automated Proof Search in Non-Classieal Logics. M.I.T. Press, Cambridge, Massachusetts, 1990.