On proof complexity of circumscription

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

Volumn 1397 LNAI, Issue , 1998, Pages 141-155

  Egly, Uwe ^a   Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC;

CLASSICAL LOGIC; COMMONSENSE REASONING; FIRST ORDER; MONOTONIC RULES; PROOF COMPLEXITY; REASONING PROCESS; SEQUENT CALCULUS; THEORETICAL COMPLEXITY;

LOGIC PROGRAMMING;

EID: 84886286630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69778-0_19     Document Type: Conference Paper

References (28)

1. G. Amati, L. C. Aiello, D. Gabbay and F. Pirri. A Proof Theoretical Approach to Default Reasoning I: Tableaux for Default Logic. Journal of Logic and Computation, 6(2):205-231, 1996.
2. P. A. Bonatti. A Gentzen System for Non-Theorems. Technical Report CD-TR 93/52, Christian Doppler Labor fUr Expertensysteme, Technische Universität Wien, Paniglgasse 16, A-1040 Wien, 1993.
3. P. A. Bonatti. Sequent Calculi for Default and Autoepistemic Logics. Proceedings TABLEA UX'96, Springer LNAI 1071, pp. 127-142, 1996.
4. P. A. Bonatti and N. Olivetti. A Sequent Calculus for Skeptical Default Logic. Proceedings TABLEA UX'97, Springer LNAI 1227, pp. 107-121, 1997.
5. P.A. Bonatti and N. Olivetti. A Sequent Calculus for Circumscription. Preliminary Proceedings CSL'97, BRICS Notes Series NS-97-1, pp. 95-107, 1997.
6. M. Cadoli, F. M. Donini, and M. Schaerf. Is Intractability of Non-Monotonic Reasoning a Real Drawback? In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 946-951. MIT Press, 1994.
7. M. Cadoli, F. M. Donini, and M. Schaerf. On Compact Representation of Pro-positional Circumscription. In Proceedings STACS '95, Springer LNCS 900, pp. 205-216, 1995.
8. M. Cadoli and M. Schaerf. A Survey of Complexity Results for Non-Monotonic Logics. Journal of Logic Programming, 17:127-160, 1993.
9. K. L. Clark. Negation as Failure. In Logic and Databases, Plenum, New York, pp. 293-322, 1978.
10. U. Egly and H. Tompits. Is Nonmonotonic Reasoning Always Harder? Proceedings LPNMR'97, Springer LNAI 1265, pp. 60-75, 1997.
11. U. Egly and H. Tompits. Non-Elementary Speed-Ups in Default Reasoning. Proceedings ECSQARU-FAPR'97, Springer LNAI 1244, pp. 237-251, 1997.
12. T. Eiter and G. Gottlob. Propositional Circumscription and Extended Closed World Reasoning are LTp-complete. Journal of Theoretical Computer Science, 114(2):231-245, 1993. Addendum: vol. 118, p. 315, 1993.
13. V. Goranko. Refutation Systems in Modal Logic. Studia Logica, 53(2):299-324, 1994.
14. G. Gottlob. Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation, 2:397-425, 1992.
15. H. A. Kautz and B. Selman. Hard Problems for Simple Default Logics. Artificial Intelligence, 49:243-379, 1990.
16. V. Lifschitz. Computing Circumscription. In Proceedings of IJCAI'85, Morgan Kaufmann, Los Altos, CA, pp. 121-127, 1985.
17. J. Lukasiewicz. Aristotle's Syllogistic from the Standpoint of Modern Formal Logic. Clarendon Press, Oxford, 1951.
18. W. Marek, A. Nerode and J. Remmel. A Theory of Nonmonotonic Rule Systems II. Annals of Mathematics and Artificial Intelligence, 5:229-264, 1992.
19. J. McCarthy. Epistemological Problems of Artificial Intelligence. In Proceedings ofIJCAI'77, Cambridge, MA, pp. 1038-1044, 1977.
20. J. McCarthy. Circumscription-AForm of Non-Monotonic Reasoning. Artificial Intelligence, 13:27-39, 1980.
21. I. Niemela. A Tableau Calculus for Minimal Model Reasoning. Proceedings TA-BLEAUX'96, Springer LNAI 1071, pp. 278-294, 1996.
22. I. Niemela. Implementing Circumscription Using a Tableau Method. Proceedings ECAI'96, John Wiley & Sons Ltd., Chichester, pp. 80-84, 1996.
23. N. Olivetti. Tableaux and Sequent Calculus for Minimal Entailment. Journal of Automated Reasoning, 9:99-139, 1992.
24. V. P. Orevkov. Lower Bounds for Increasing Complexity of Derivations after Cut Elimination. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matemati-cheskogo Instituta im V. A. Steklova AN SSSR, 88:137-161, 1979.
25. English translation in Journal ofSoviet Mathematics, 2337-2350, 1982.
26. R. Reiter. On Closed-World Data Bases. In Logic and Databases, pp. 55-76, Plenum, New York, 1978.
27. J. Schlipf. Decidability and Definability with Circumscription. Annals of Pure and Applied Logic, 35:173-191, 1987.
28. A. Varzi. Complementary Sentential Logics. Bulletin of the Section of Logic, 19:112-116, 1990.