{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:18:20Z","timestamp":1725459500662},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630951"},{"type":"electronic","value":"9783540691297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0035626","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:29:25Z","timestamp":1138202965000},"page":"237-251","source":"Crossref","is-referenced-by-count":4,"title":["Non-elementary speed-ups in default reasoning"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Egly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1994-2044","volume":"20","author":"M. Baaz","year":"1994","unstructured":"M. Baaz and A. Leitsch. On Skolemization and Proof Complexity. Fundamenta Informaticae, 20:353\u2013379, 1994.","journal-title":"Fundamenta Informaticae"},{"key":"19_CR2","volume-title":"Technical Report CD-TR 93\/52","author":"P. A. Bonatti","year":"1993","unstructured":"P. A. Bonatti. A Gentzen System for Non-Theorems. Technical Report CD-TR 93\/52, Christian Doppler Labor f\u00fcr Expertensysteme, Technische Universit\u00e4t Wien, Paniglgasse 16, A-1040 Wien, 1993."},{"doi-asserted-by":"crossref","unstructured":"P. A. Bonatti. Sequent Calculi for Default and Autoepistemic Logics. In Proceedings TABLEAUX'96, Springer LNCS 1071, pp. 127\u2013142, 1996.","key":"19_CR3","DOI":"10.1007\/3-540-61208-4_9"},{"unstructured":"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\u2013951. MIT Press, 1994.","key":"19_CR4"},{"doi-asserted-by":"crossref","unstructured":"M. Cadoli, F. M. Donini, and M. Schaerf. On Compact Representation of Propositional Circumscription. In Proceedings STACS '95, Springer LNCS 900, pp. 205\u2013216, 1995.","key":"19_CR5","DOI":"10.1007\/3-540-59042-0_74"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","volume":"17","author":"M. Cadoli","year":"1993","unstructured":"M. Cadoli and M. Schaerf. A Survey of Complexity Results for Non-Monotonic Logics. Journal of Logic Programming, 17:127\u2013160, 1993.","journal-title":"Journal of Logic Programming"},{"key":"19_CR7","volume-title":"PhD thesis","author":"U. Egly","year":"1994","unstructured":"U. Egly. On Methods of Function Introduction and Related Concepts. PhD thesis, Technische Hochschule Darmstadt, Alexanderstr. 10, D-64283 Darmstadt, 1994."},{"key":"19_CR8","volume-title":"Is Nonmonotonic Reasoning Always Harder?","author":"U. Egly","year":"1996","unstructured":"U. Egly and H. Tompits. Is Nonmonotonic Reasoning Always Harder? In Ilkka Niemel\u00e4, editor, Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Fachberichte Informatik 18-96, Universit\u00e4t Koblenz-Landau, Institut f\u00fcr Informatik, Rheinau 1, D-56075 Koblenz, 1996. http:\/\/www.uni-koblenz.de\/universitaet\/fb\/fb4\/publications\/GelbeReihe\/RR-18-96\/proceedings.html"},{"issue":"2","key":"19_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"T. Eiter and G. Gottlob. Propositional Circumscription and Extended Closed World Reasoning are \u03a0 2 P -complete. Journal of Theoretical Computer Science, 114(2):231\u2013245, 1993. Addendum in vol. 118, p. 315, 1993.","journal-title":"Journal of Theoretical Computer Science"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"G. Gottlob. Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation, 2:397\u2013425, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01543477","volume":"5","author":"W. Marek","year":"1992","unstructured":"W. Marek, A. Nerode and J. Remmel. A Theory of Nonmonotonic Rule Systems II. Annals of Mathematics and Artificial Intelligence, 5:229\u2013264, 1992.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"19_CR12","first-page":"137","volume":"88","author":"V. P. Orevkov","year":"1979","unstructured":"V. P. Orevkov. Lower Bounds for Increasing Complexity of Derivations after Cut Elimination. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im V. A. Steklova AN SSSR, 88:137\u2013161, 1979. English translation in Journal of Soviet Mathematics, 2337\u20132350, 1982.","journal-title":"Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im V. A. Steklova AN SSSR"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter. A Logic for Default Reasoning. Artificial Intelligence Journal 13, p. 81, 1980.","journal-title":"Artificial Intelligence Journal"},{"key":"19_CR14","volume-title":"Nonmonotonic Reasoning: Compiled vs. Interpreted Theories. Considerations for the Panel at Nonmon96","author":"R. Reiter","year":"1996","unstructured":"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."},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(87)90062-5","volume":"35","author":"J. Schlipf","year":"1987","unstructured":"J. Schlipf. Decidability and Definability with Circumscription. Annals of Pure and Applied Logic, 35:173\u2013191, 1987.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"19_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1093\/logcom\/6.2.295","volume":"6","author":"G. Schwarz","year":"1996","unstructured":"G. Schwarz and M. Truszczy\u0144ski. Nonmonotonic Reasoning is Sometimes Simpler. Journal of Logic and Computation, 6(2):295\u2013308, 1996.","journal-title":"Journal of Logic and Computation"},{"key":"19_CR17","first-page":"112","volume":"19","author":"A. Varzi","year":"1990","unstructured":"A. Varzi. Complementary Sentential Logics. Bulletin of the Section of Logic, 19:112\u2013116, 1990.","journal-title":"Bulletin of the Section of Logic"}],"container-title":["Lecture Notes in Computer Science","Qualitative and Quantitative Practical Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T09:14:51Z","timestamp":1586682891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630951","9783540691297"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0035626","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}