{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:48:07Z","timestamp":1749124087951,"version":"3.40.4"},"reference-count":43,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780124500105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/b978-0-12-450010-5.50022-0","type":"book-chapter","created":{"date-parts":[[2012,12,3]],"date-time":"2012-12-03T06:20:45Z","timestamp":1354515645000},"page":"281-304","source":"Crossref","is-referenced-by-count":70,"title":["Circumscription and Disjunctive Logic Programming"],"prefix":"10.1016","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Lobo","sequence":"additional","affiliation":[]},{"given":"Arcot","family":"Rajasekar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib1","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib2","doi-asserted-by":"crossref","unstructured":"N. Bidoit and R. Hull. Positivism vs. Minimalism in Deductive Databases. Proc. ACM SIGACT-SIGMOD Symposium on the Principles of Database Systems, pages 123\u2013132, 1986.","DOI":"10.1145\/6012.15409"},{"issue":"1","key":"10.1016\/B978-0-12-450010-5.50022-0_bib3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","article-title":"Saturation, Nonmonotonic Reasoning and the Closed World Assumption","volume":"25","author":"Bossu","year":"1985","journal-title":"Artificial Intelligence"},{"year":"1973","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","key":"10.1016\/B978-0-12-450010-5.50022-0_bib4"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1111\/j.1467-8640.1985.tb00055.x","article-title":"On the Adequecy of Predicate Circumscription for Closed World Reasoning","volume":"1","author":"Etherington","year":"1985","journal-title":"Computational Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib6","doi-asserted-by":"crossref","unstructured":"M. Gelfond and V. Lifschitz. Compiling Circumscriptive Theories into Logic Programs Programming. In Proc. Second International Workshop on Non-Monotonic Reasoning, pages 74\u201399, 1989.","DOI":"10.1007\/3-540-50701-9_21"},{"issue":"3","key":"10.1016\/B978-0-12-450010-5.50022-0_bib7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(86)90001-9","article-title":"Negation as Failure: Careful Closure Procedure","volume":"30","author":"Gelfond","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib8","unstructured":"M. Gelfond, H. Przymusinska, and T. Przymusinski. Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics. Technical Report, University of Texas, El Paso, 1987."},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib9","doi-asserted-by":"crossref","unstructured":"M. Gelfond, H. Przymusinska, and T.C. Przymusinski. The Extended Closed World Assumption and Its Relation to Parallel Circumscription. Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pages 133\u2013139, 1986.","DOI":"10.1145\/6012.15410"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","article-title":"On the Relationship between Circumscription and Negation as Failure","volume":"38","author":"Gelfond","year":"1989","journal-title":"Journal of Artificial Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(87)90064-6","article-title":"Results on Translating Defaults to Circumscription","volume":"32","author":"Imielinski","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib12","unstructured":"V. Lifschitz. Computing Circumscription. Proc. Ninth International Joint Conference on Artificial Intelligence, Morgan Kaufman Publishers, Palo Alto, California, pages 121\u2013127, 1985."},{"issue":"2","key":"10.1016\/B978-0-12-450010-5.50022-0_bib13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","article-title":"Closed World Databases and Circumscription","volume":"27","author":"Lifschitz","year":"1985","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/B978-0-12-450010-5.50022-0_bib14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(86)90028-7","article-title":"On the Satisfiability of Circumscription","volume":"28","author":"Lifschitz","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib15","first-page":"406","article-title":"Pointwise Circumscription: A Preliminary Report","author":"Lifschitz","year":"1986","journal-title":"AAAI"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib16","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"On the Declarative Semantics of Logic Programs with Negation","author":"Lifschitz","year":"1988"},{"year":"1987","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/B978-0-12-450010-5.50022-0_bib17"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib18","doi-asserted-by":"crossref","unstructured":"J. Lobo, J. Minker, and A. Rajasekar. Extending the Semantics of Logic Programs to Disjunctive Logic Programs. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, Lisbon, Portugal, 1989.","DOI":"10.1016\/0743-1066(90)90033-2"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib19","unstructured":"J. McCarthy. Epistemological Problems in Artificial Intelligence. In Proc. Fifth International Conference on Artificial Intelligence, pages 1038\u20131044, 1977."},{"issue":"1 and 2","key":"10.1016\/B978-0-12-450010-5.50022-0_bib20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription \u2013 A Form of Non-Monotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/B978-0-12-450010-5.50022-0_bib21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Applications of Circumscription to Formalizing Commonsense Knowledge","volume":"28","author":"McCarthy","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib22","first-page":"292","article-title":"On Indefinite Databases and the Closed World Assumption","volume":"138","author":"Minker","year":"1982"},{"issue":"4","key":"10.1016\/B978-0-12-450010-5.50022-0_bib23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0743-1066(85)80002-9","article-title":"Computing Protected Circumscription","volume":"2","author":"Minker","year":"1985","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib24","doi-asserted-by":"crossref","unstructured":"J. Minker and D. Perlis. Applications of Protected Circumscription. Proc. Conference on Automated Deduction, 1984.","DOI":"10.1007\/978-0-387-34768-4_24"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib25","doi-asserted-by":"crossref","unstructured":"J. Minker and D. Perlis. Protected Circumscription. Proc. Workshop on Non-Monotonic Reasoning, pages 337\u2013343, 1984.","DOI":"10.1007\/978-0-387-34768-4_24"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib26","doi-asserted-by":"crossref","unstructured":"J. Minker and A. Rajasekar. Procedural Interpretation of Non-Horn Logic Programs. In E. Lusk and R. Overbeek, editors, Proc. Ninth International Conference on Automated Deduction, pages 278\u2013293, Argonne, IL, 1988.","DOI":"10.1007\/BFb0012837"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","article-title":"A Fixpoint Semantics for Disjunctive Logic Programs","volume":"9","author":"Minker","year":"1990","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib28","series-title":"Computational Logic: Essays in Honor of Alan Robinson","article-title":"Theory of Disjunctive Logic Programs","author":"Minker","year":"1990"},{"issue":"3","key":"10.1016\/B978-0-12-450010-5.50022-0_bib29","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(82)90035-7","article-title":"An Extension to Linear Resolution with Selection Function","volume":"14","author":"Minker","year":"1982","journal-title":"Information Processing Letters"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib30","unstructured":"Y. Moinard. Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes). In R.A. Kowalski and K.A. Bowen, editors, Proc. Fifth International Conference and Symposium on Logic Programming, pages 1097\u20131105, Seattle, Washington, 1988."},{"issue":"2","key":"10.1016\/B978-0-12-450010-5.50022-0_bib31","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0004-3702(87)90020-8","article-title":"Circumscribing with Sets","volume":"31","author":"Perlis","year":"1987","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/B978-0-12-450010-5.50022-0_bib32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(86)90029-9","article-title":"Completeness Results for Circumscription","volume":"28","author":"Perlis","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib33","unstructured":"T. Przymusinski. On the Relationship between Logic Programming and Non-Monotonic Reasoning. In Proc. AAAI-88, pages 444\u2013448, 1988."},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib34","unstructured":"T. Przymusinski. Three-Valued Formalizations of Nonmonotonic Reasoning and Logic Programming. In Proceedings of First International Conference on Knowledge Representation and Reasoning, pages 341\u2013348, 1989."},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib35","first-page":"49","article-title":"An Algorithm to Compute Circumscription","volume":"38","author":"Przymusinski","year":"1989","journal-title":"AI Journal"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib36","series-title":"Logic Programming \u2013 A New Perspective","article-title":"Non-Monotonic Reasoning","author":"Przymusinski","year":"1988"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib37","unstructured":"A. Rajasekar. Semantics for Disjunctive Logic Programs. Ph.D. Thesis, University of Maryland, Department of Computer Science, 1989."},{"journal-title":"Procedural Interpretation for Normal Disjunctive Logic programs","year":"1991","author":"Rajasekar","key":"10.1016\/B978-0-12-450010-5.50022-0_bib38"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib39","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","article-title":"Weak Generalized Closed World Assumption","volume":"5","author":"Rajasekar","year":"1989","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib40","unstructured":"R. Reiter. Circumscription Implies Predicate Completion (Sometimes). Proc. Amer. Assoc. for Art. Intell. National Conference, pages 418\u2013420, 1982."},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib41","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"issue":"4","key":"10.1016\/B978-0-12-450010-5.50022-0_bib42","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"JACM"},{"key":"10.1016\/B978-0-12-450010-5.50022-0_bib43","unstructured":"J. You and L. Li. Supported Circumscription and Its Relation to Logic Programming with Negation. In Proc. of the North American Conference on Logic Programming, Cleveland, pages 291\u2013312, 1989."}],"container-title":["Artificial and Mathematical Theory of Computation"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T02:50:48Z","timestamp":1745376648000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780124500105500220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780124500105"],"references-count":43,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-450010-5.50022-0","relation":{},"subject":[],"published":{"date-parts":[[1991]]}}}