{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:12:45Z","timestamp":1725495165090},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44404-1_1","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:20:51Z","timestamp":1194981651000},"page":"1-19","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Theory Curbing"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02309344","volume":"56","author":"B. Bodenstorfer","year":"1996","unstructured":"B. Bodenstorfer. How Many Minimal Upper Bounds of Minimal Upper Bounds. Computing, 56:171\u2013178, 1996. 2, 7, 8","journal-title":"Computing"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","volume":"44","author":"M. Cadoli","year":"1992","unstructured":"M. Cadoli. The Complexity of Model Checking for Circumscriptive Formulae. Information Processing Letters, 44:113\u2013118, 1992. 2","journal-title":"Information Processing Letters"},{"key":"1_CR3","unstructured":"M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI\/IAAI-98, pp. 262\u2013267, 1998. 2"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/69.219736","volume":"5","author":"E. Chan","year":"1993","unstructured":"E. Chan. A Possible Worlds Semantics for Disjunctive Databases. IEEE Trans. Knowledge and Data Engineering, 5(2):282\u2013292, 1993. 1, 2","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"1_CR5","unstructured":"H. Decker and J. C. Casamayor. Sustained Models and Sustained Answers in First-Order Databases. In A. Oliv\u00e9, editor, Proc. 4th International Workshop on the Deductive Approach to Information Systems and Databases (DAISD 1993), 1993, Lloret de Mar, Catalonia, pp. 267\u2013286, Report de recerca, LSI\/93-25-R, Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, 1990. 1, 2"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","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 \u03a0P 2-complete. Theoretical Computer Science, 114(2):231\u2013245, 1993. Addendum 118:315. 2","journal-title":"Theoretical Computer Science"},{"key":"1_CR7","unstructured":"T. Eiter, G. Gottlob, and Y. Gurevich. Curb Your Theory! A circumscriptive approach for inclusive interpretation of disjunctive information. In R. Bajcsy, editor, Proc. 13th Intl. Joint Conference on Artificial Intelligence (IJCAI-93), pp. 634\u2013639. Morgan Kaufmann, 1993. 1, 1, 1, 2, 2, 2, 3, 3, 3, 5, 6, 6, 6, 6, 6, 7, 7, 7, 14"},{"key":"1_CR8","unstructured":"R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quanti-fied Boolean Formulae. In Proc. National Conference on AI (AAAI\u201900), Austin, Texas, 2000. AAAI Press. 2"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"A. Fl\u00f6gel","year":"1995","unstructured":"A. Fl\u00f6gel, M. Karpinski, and H. Kleine B\u00fcning. Resolution for Quantified Boolean Formulas. Information and Computation, 117:12\u201318, 1995. 2","journal-title":"Information and Computation"},{"key":"1_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-62222-5_51","volume-title":"The Complexity of Iterated Belief Revision","author":"P. Liberatore","year":"1997","unstructured":"P. Liberatore. The Complexity of Iterated Belief Revision. In F. Afrati and P. Kolaitis, editors, Proc. 6th Intl. Conference on Database Theory (ICDT-97), LNCS 1186, pp. 276\u2013290, Springer, 1997. 2, 2"},{"issue":"1\u20132","key":"1_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0004-3702(00)00016-3","volume":"119","author":"P. Liberatore","year":"2000","unstructured":"P. Liberatore. The Complexity of Belief Update. Artificial Intelligence, 119(1\u20132):141\u2013190, 2000. 2","journal-title":"Artificial Intelligence"},{"key":"1_CR12","unstructured":"V. Lifschitz. Computing Circumscription. In Proc. International Joint Conference on Artificial Intelligence (IJCAI-85), pp. 121\u2013127, 1985. 5, 6"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1093\/oso\/9780198537472.003.0006","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"V. Lifschitz","year":"1994","unstructured":"V. Lifschitz. Circumscription. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume III, pages 297\u2013352. Clarendon Press, Oxford, 1994. 1, 16"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy. Circumscription-A Form of Non-Monotonic Reasoning. Artificial Intelligence, 13:27\u201339, 1980. 1","journal-title":"Artificial Intelligence"},{"key":"1_CR15","unstructured":"J. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. IJCAI\u2019 99, pp. 1192\u20131197. AAAI Press, 1999. 2"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"K. Ross. The Well-Founded Semantics for Disjunctive Logic Programs. In W. Kim, J.-M. Nicholas, and S. Nishio, editors, Proc. First Intl. Conf. on Deductive and Object-Oriented Databases (DOOD-89), pp. 352\u2013369. Elsevier Science Pub., 1990. 1, 2","DOI":"10.1016\/B978-0-444-88433-6.50029-0"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K. Ross","year":"1988","unstructured":"K. Ross and R. Topor. Inferring Negative Information From Disjunctive Databases. Journal of Automated Reasoning, 4(2):397\u2013424, 1988. 1, 2","journal-title":"Journal of Automated Reasoning"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"C. Sakama. Possible Model Semantics for Disjunctive Databases. In W. Kim, J.-M. Nicholas, and S. Nishio, editors, Proc. First Intl. Conf. on Deductive and Object-Oriented Databases (DOOD-89), pp. 337\u2013351. Elsevier Science Pub., 1990. 1, 2","DOI":"10.1016\/B978-0-444-88433-6.50028-9"},{"key":"1_CR19","unstructured":"C. Sakama and K. Inoue. Negation in Disjunctive Logic Programs. In Proc. ICLP-93, Budapest, Hungary, June 1993. MIT-Press. 1, 2"},{"key":"1_CR20","unstructured":"F. Scarcello, N. Leone, and L. Palopoli. Curbing Theories: Fixpoint Semantics and Complexity Issues. In M. Alpuente and M. I. Sessa, editors, Proc. 1995 Joint Conference on Declarative Programming (GULP-PRODE\u201995), pp. 545\u2013554. Palladio Press, 1995. 2, 2, 3, 3, 3, 15"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"J. van Benthem and K. Doets. Higher Order Logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Vol.I, chapter I.4, pp. 275\u2013329. D.Reidel Pub., 1983. 5, 5","DOI":"10.1007\/978-94-009-7066-3_4"}],"container-title":["Lecture Notes in Artificial Intelligence","Logic for Programming and Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44404-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:26:00Z","timestamp":1708302360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44404-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540412854"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44404-1_1","relation":{},"subject":[]}}