Non-elementary speed-ups in default reasoning

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

Volumn 1244, Issue , 1997, Pages 237-251

  Egly, Uwe ^a   Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

CLASSICAL LOGIC; COMMONSENSE REASONING; DEFAULT LOGIC; DEFAULT REASONING; DEFAULT RULE; REASONING PROCESS; SEQUENT CALCULUS; THEORETICAL COMPLEXITY;

COMPUTER CIRCUITS;

EID: 84947742837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0035626     Document Type: Conference Paper

References (17)

1. M. Baaz and A. Leitsch. On Skolemization and Proof Complexity. Fundamenta Informaticae, 20:353-379, 1994.
2. P. A. Bonatti. A Gentzen System for Non-Theorems. Technical Report CD-TR 93/52, Christian Doppler Labor für Expertensysteme, Technische Universität Wien, Paniglgasse 16, A-1040 Wien, 1993.
3. P. A. Bonatti. Sequent Calculi for Default and Autoepistemic Logics. In Proceedings TABLE A UX’96, Springer LNCS 1071, pp. 127-142, 1996.
4. 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, pp. 946-951. MIT Press, 1994.
5. M. Cadoli, F. M. Donini, and M. Schaerf. On Compact Representation of Prepositional Circumscription. In Proceedings STACS’95, Springer LNCS 900, pp. 205-216, 1995.
6. M. Cadoli and M. Schaerf. A Survey of Complexity Results for Non-Monotonic Logics. Journal of Logic Programming, 17:127-160, 1993.
7. U. Egly. On Methods of Function Introduction and Related Concepts. PhD thesis, Technische Hochschule Darmstadt, Alexanderstr. 10, D-64283 Darmstadt, 1994.
8. U. Egly and H. Tompits. Is Nonmonotonic Reasoning Always Harder? In Ilkka Niemelä, editor, Proceedings of the ECAI’96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Fachberichte Informatik 18-96, Universität Koblenz-Landau, Institut für Informatik, Rheinau 1, D-56075 Koblenz, 1996. http://www.uni-koblenz.de/universitaet/fb/fb4/publications/GelbeReihe/RR-18-96/proceedings.html
9. T. Eiter and G. Gottlob. Propositional Circumscription and Extended Closed World Reasoning are (Formula presented)-complete. Journal of Theoretical Computer Science, 114(2):231-245, 1993. Addendum in vol. 118, p. 315, 1993.
10. G. Gottlob. Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation, 2:397-425, 1992.
11. W. Marek, A. Nerode and J. Remmel. A Theory of Nonmonotonic Rule Systems II. Annals of Mathematics and Artificial Intelligence, 5:229-264, 1992.
12. V. P. Orevkov. Lower Bounds for Increasing Complexity of Derivations after Cut Elimination. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matem-aticheskogo Instituta im V. A. Steklova AN SSSR, 88:137-161, 1979. English translation in Journal of Soviet Mathematics, 2337-2350, 1982.
13. R. Reiter. A Logic for Default Reasoning. Artificial Intelligence Journal 13, p. 81, 1980.
14. R. Reiter. Nonmonotonic Reasoning: Compiled vs. Interpreted Theories. Considerations for the Panel at Nonmon96. Proceedings of the Sixth International Workshop on Nonmonotonic Reasoning, Timberline, Oregon, 1996.
15. J. Schlipf. Decidability and Definability with Circumscription. Annals of Pure and Applied Logic, 35:173-191, 1987.
16. G. Schwarz and M. Truszczynski. Nonmonotonic Reasoning is Sometimes Simpler. Journal of Logic and Computation, 6(2):295-308, 1996.
17. A. Varzi. Complementary Sentential Logics. Bulletin of the Section of Logic, 19:112-116, 1990.