{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:08Z","timestamp":1725664508923},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632559"},{"type":"electronic","value":"9783540692492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63255-7_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:23:00Z","timestamp":1330280580000},"page":"60-75","source":"Crossref","is-referenced-by-count":2,"title":["Is non-monotonic reasoning always harder"],"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,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0168-0072(92)90042-X","volume":"57","author":"M. Baaz","year":"1992","unstructured":"M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57:181\u2013215, 1992.","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR2","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":"5_CR3","volume-title":"Default Logic, Propositional Logic and Constraints","author":"R. Ben-Eliyahu","year":"1991","unstructured":"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."},{"key":"5_CR4","volume-title":"Deduction: Automated Logic","author":"W. Bibel","year":"1993","unstructured":"W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013142, 1996.","DOI":"10.1007\/3-540-61208-4_9"},{"key":"5_CR6","unstructured":"M. Cadoli, F. M. Donini, and M. Schaerf. Is Intractability of Non-Monotonic Reasoninga Real Drawback? In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 946\u2013951. MIT Press, 1994."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"M. Cadoli, F. M. Donini, and M. Schaerf. On Compact Representation of Propositional Circumscription. In Proceedings STAGS '95, Springer LNCS 900, pp. 205\u2013216, 1995.","DOI":"10.1007\/3-540-59042-0_74"},{"key":"5_CR8","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":"5_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W. F. Dowling","year":"1984","unstructured":"W. F. Dowling and J. H. Gallier. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming, 3:267\u2013284, 1984.","journal-title":"Journal of Logic Programming"},{"key":"5_CR10","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":"5_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jsco.1996.0044","volume":"22","author":"U. Egly","year":"1996","unstructured":"U. Egly. On Different Structure-Preserving Translations to Normal Form, 1996. Journal of Symbolic Computation, 22:121\u2013142.","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"U. Egly and H. Tompits. Non-Elementary Speed-Ups in Default Reasoning. To appear in Proceedings ECSQARU'97, Springer 1997.","DOI":"10.1007\/BFb0035626"},{"issue":"2","key":"5_CR13","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 P 2-complete. Journal of Theoretical Computer Science, 114(2):231\u2013245, 1993. Addendum: vol. 118, p. 315, 1993.","journal-title":"Journal of Theoretical Computer Science"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"G. Gentzen. Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift, 39:176\u2013210, 405\u2013431, 1935.","journal-title":"Mathematische Zeitschrift"},{"key":"5_CR15","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":"5_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","volume":"49","author":"H. A. Kautz","year":"1990","unstructured":"H. A. Kautz and B. Selman. Hard Problems for Simple Default Logics. Artificial Intelligence, 49:243\u2013379, 1990.","journal-title":"Artificial Intelligence"},{"key":"5_CR17","first-page":"121","volume-title":"Proceedings of IJCAI-85","author":"V. Lifschitz","year":"1985","unstructured":"V. Lifschitz. Computing Circumscription. In Proceedings of IJCAI-85, pages 121\u2013127, Los Altos, CA., 1985. Morgan Kaufmann."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-1992-171-208","volume":"17","author":"I. Niemel\u00e4","year":"1992","unstructured":"I. Niemel\u00e4. On the Decidability and Complexity of Autoepistemic Reasoning. Fundamenta Informaticae, 17:117\u2013155, 1992.","journal-title":"Fundamenta Informaticae"},{"key":"5_CR19","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":"5_CR20","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":"5_CR21","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":"5_CR22","doi-asserted-by":"crossref","unstructured":"R. Statman. Lower Bounds on Herbrand's Theorem. In Proc. AMS 75, pages 104\u2013107, 1979.","DOI":"10.2307\/2042682"}],"container-title":["Lecture Notes in Computer Science","Logic Programming And Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63255-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:45:14Z","timestamp":1640933114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63255-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632559","9783540692492"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-63255-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}