{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:14:42Z","timestamp":1649103282267},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01536401","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T06:38:02Z","timestamp":1113892682000},"page":"357-378","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of computing with extended propositional logic programs"],"prefix":"10.1007","volume":"15","author":[{"given":"V.","family":"Wiktor Marek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arcot","family":"Rajasekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01536401_CR1","first-page":"89","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1987","unstructured":"K. Apt, H.A. Blair, and A. Walker, Towards a theory of declarative knowledge, in J. Minker, editor,Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1987) pp. 89\u2013142."},{"key":"BF01536401_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"N. Bidoit and Ch. Froidevaux, Negation by default and unstratifiable logic programs, Theor. Comp. Sci. 78 (1991) 85\u2013112.","journal-title":"Theor. Comp. Sci."},{"key":"BF01536401_CR3","doi-asserted-by":"crossref","first-page":"85","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, J. Logic Programming 17 (1993) 85\u2013112.","journal-title":"J. Logic Programming"},{"key":"BF01536401_CR4","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, J. Logic Programming 3 (1984) 267\u2013284.","journal-title":"J. Logic Programming"},{"key":"BF01536401_CR5","unstructured":"T. Eiter and G. Gottlob, Complexity results for disjunctive logic programming and application to nonmonotonic logics, in D. Miller, editor,Proceedings of the 1993 International Symposium on Logic Programming (MIT Press, 1993) pp. 266\u2013278."},{"key":"BF01536401_CR6","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, 1979)."},{"key":"BF01536401_CR7","first-page":"1070","volume-title":"The stable semantics for logic programs","author":"M. Gelfond","year":"1988","unstructured":"M. Gelfond and V. Lifschitz, The stable semantics for logic programs, in R. Kowalski and K. Bowen, editors,Proceedings of the 5th International Symposium on Logic Programming (MIT Press, Cambridge, MA., 1988) pp. 1070\u20131080."},{"key":"BF01536401_CR8","unstructured":"M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, submitted for publication (1990)."},{"key":"BF01536401_CR9","first-page":"579","volume-title":"Logic programs with classical negation","author":"M. Gelfond","year":"1990","unstructured":"M. Gelfond and V. Lifschitz, Logic programs with classical negation, in D. Warren and P. Szeredi, editors,Logic Programming: Proceedings of the 7th International Conference (MIT Press, Cambridge, MA., 1990) pp. 579\u2013597."},{"key":"BF01536401_CR10","unstructured":"M. Gelfond, V. Lifschitz, H. Przymusinska, and M. Truszczynski, Disjunctive default,Second International Conference on Principles of Knowledge Representation and Reasoning, KR '91, Cambridge, MA, 1991."},{"key":"BF01536401_CR11","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 closed world reasoning are \u03c02-complete, Theor. Comp. Sci. 114 (1993) 231\u2013245.","journal-title":"Theor. Comp. Sci."},{"key":"BF01536401_CR12","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 logic, J. Logic and Comput. 2 (1992) 397\u2013425.","journal-title":"J. Logic and Comput."},{"key":"BF01536401_CR13","volume-title":"A Companion to Modal Logic","author":"G.E. Hughes","year":"1984","unstructured":"G.E. Hughes and M.J. Cresswell,A Companion to Modal Logic (Methuen, London, 1984)."},{"key":"BF01536401_CR14","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"R. Ladner, The computational complexity of provability in systems of modal propositional logic, SIAM J. Comp. 6 (1977) 467\u2013480.","journal-title":"SIAM J. Comp."},{"key":"BF01536401_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","volume":"29","author":"D. McDermott","year":"1982","unstructured":"D. McDermott, Nonmonotonic logic II: Nonmonotonic modal theories, J. ACM 29 (1982) 33\u201357.","journal-title":"J. ACM"},{"key":"BF01536401_CR16","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume":"138","author":"J. Minker","year":"1982","unstructured":"J. Minker, On indefinite databases and the closed world assumption, Lecture Notes in Comp. Sci. 138 (1982) 292\u2013308.","journal-title":"Lecture Notes in Comp. Sci."},{"key":"BF01536401_CR17","first-page":"243","volume-title":"Stable semantics for logic programs and default theories","author":"W. Marek","year":"1989","unstructured":"W. Marek and M. Truszczy\u0144ski, Stable semantics for logic programs and default theories, in E. Lusk and R. Overbeek, editors,Proceedings of the North American Conference on Logic Programming (MIT Press, Cambridge, MA, 1989) pp. 243\u2013256."},{"key":"BF01536401_CR18","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"W. Marek and M. Truszczy\u0144ski, Autoepistemic logic, J. ACM 38 (1991) 588\u2013619.","journal-title":"J. ACM"},{"key":"BF01536401_CR19","volume-title":"Nonmonotonic Logics; Context-Dependent Reasoning","author":"W. Marek","year":"1993","unstructured":"W. Marek and M. Truszczy\u0144ski,Nonmonotonic Logics; Context-Dependent Reasoning (Springer-Verlag, Berlin, 1993)."},{"key":"BF01536401_CR20","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 13 (1980) 81\u2013132.","journal-title":"Artificial Intelligence"},{"key":"BF01536401_CR21","first-page":"313","volume-title":"Lecture Notes in Comp. Sci. 713","author":"G.F. Schwarz","year":"1993","unstructured":"G.F. Schwarz and M. Truszczy\u0144ski, Nonmonotonic reasoning is sometimes easier,Proc. Kurt G\u00f6del Symp., Lecture Notes in Comp. Sci. 713 (Springer-Verlag, Berlin, 1993) pp. 313\u2013324."},{"key":"BF01536401_CR22","first-page":"393","volume-title":"Proc. IJCAI-91","author":"M. Truszczy\u0144ski","year":"1991","unstructured":"M. Truszczy\u0144ski, Modal interpretations of default logic,Proc. IJCAI-91 (Morgan Kaufmann, San Mateo, CA., 1991) pp. 393\u2013398."},{"issue":"4","key":"BF01536401_CR23","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language. J. ACM 23(4) (1976) 733\u2013742.","journal-title":"J. ACM"},{"key":"BF01536401_CR24","unstructured":"F. Yang, Programming in default logic, PhD Thesis, Syracuse University (1993)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01536401\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01536401.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01536401\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01536401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:47:29Z","timestamp":1556891249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01536401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01536401"],"URL":"https:\/\/doi.org\/10.1007\/bf01536401","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}