Is non-monotonic reasoning always harder?

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

Volumn 1265, Issue , 1997, Pages 60-75

  Egly, Uwe ^a   Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING;

FIRST ORDER; NON MONOTONIC SYSTEMS; NON-MONOTONIC REASONING; PROOF-LENGTH; SEQUENT CALCULUS; SPEED UP;

COMPUTER CIRCUITS;

EID: 84946750540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_5     Document Type: Conference Paper

References (22)

1. M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57:181-215, 1992.
2. M. Baaz and A. Leitsch. On Skolemization and Proof Complexity. Fundamenta Informaticae, 20:353-379, 1994.
3. R. Ben-Eliyahu and R. Dechter. Default Logic, Propositional Logic and Constraints. In Proceedings of the AAAI National Conference on Artificial Intelligence, Los Altos, CA, 1991. Morgan Kaufmann.
4. W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993.
5. P. A. Bonatti. Proof Systems for Default and Autoepistemic Logics. In P. Miglioli, U. Moscato, D. Mundici and M. Ornaghi, editors, Proceedings TABLEAUX’96, Springer LNCS 1071, pp. 127-142, 1996.
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 Propositional 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. W. F. Dowling and J. H. Gallier. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming, 3:267-284, 1984.
10. U. Egly. On Methods of Function Introduction and Related Concepts. PhD thesis, Technische Hochschule Darmstadt, Alexanderstr. 10, D-64283 Darmstadt, 1994.
11. U. Egly. On Different Structure-Preserving Translations to Normal Form, 1996. Journal of Symbolic Computation, 22:121-142.
12. U. Egly and H. Tompits. Non-Elementary Speed-Ups in Default Reasoning. To appear in Proceedings ECSQARU’97, Springer 1997.
13. P-complete. Journal of Theoretical Computer Science, 114(2):231-245, 1993. Addendum: vol. 118, p. 315, 1993.
14. G. Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176-210, 405-431, 1935.
15. G. Gottlob. Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation, 2:397-425, 1992.
16. H. A. Kautz and B. Selman. Hard Problems for Simple Default Logics. Artificial Intelligence, 49:243-379, 1990.
17. V. Lifschitz. Computing Circumscription. In Proceedings of IJCAI-85, pages 121-127, Los Altos, CA., 1985. Morgan Kaufmann.
18. I. Niemelä. On the Decidability and Complexity of Autoepistemic Reasoning. Fundamenta Informaticae, 17:117-155, 1992.
19. V. P. Orevkov. Lower Bounds for Increasing Complexity of Derivations after Cut Elimination. Zapiski Nauehnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im V. A. Steklova AN SSSR, 88:137-161, 1979. English translation in Journal of Soviet Mathematics, 2337-2350, 1982.
20. J. Schlipf. Decidability and Definability with Circumscription. Annals of Pure and Applied Logic, 35:173-191, 1987
21. G. Schwarz and M. Truszczyñski. Nonmonotonic Reasoning is Sometimes Simpler. Journal of Logic and Computation, 6(2):295-308, 1996.
22. R. Statman. Lower Bounds on Herbrand’s Theorem. In Proc. AMS 75, pages 104-107, 1979.