{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:03:08Z","timestamp":1762297388406,"version":"build-2065373602"},"reference-count":93,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444522115"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1016\/s1574-6526(07)03007-6","type":"book-chapter","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T16:06:55Z","timestamp":1221235615000},"page":"285-316","source":"Crossref","is-referenced-by-count":70,"title":["Chapter 7 Answer Sets"],"prefix":"10.1016","member":"78","reference":[{"key":"10.1016\/S1574-6526(07)03007-6_bib001","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\/S1574-6526(07)03007-6_bib002","series-title":"Proc. of the Internat. Conf. on Theoretical Aspects of Computer Software","first-page":"265","article-title":"Proving termination in general Prolog programs","volume":"vol. 526","author":"Apt","year":"1991"},{"key":"10.1016\/S1574-6526(07)03007-6_bib003","unstructured":"Y. Babovich and M. Maratea. Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR-05, Jan. 2004"},{"key":"10.1016\/S1574-6526(07)03007-6_bib004","series-title":"PADL'04","article-title":"USA-Smart: Improving the quality of plans in answer set planning","author":"Balduccini","year":"2004"},{"key":"10.1016\/S1574-6526(07)03007-6_bib005","unstructured":"M. Balduccini. Answer set based design of highly autonomous, rational agents. PhD thesis, Texas Tech University, Dec. 2005"},{"issue":"4\u20135","key":"10.1016\/S1574-6526(07)03007-6_bib006","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1017\/S1471068403001807","article-title":"Diagnostic reasoning with A-Prolog","volume":"3","author":"Balduccini","year":"2003","journal-title":"Journal of Theory and Practice of Logic Programming (TPLP)"},{"key":"10.1016\/S1574-6526(07)03007-6_bib007","unstructured":"M. Balduccini and M. Gelfond. Logic programs with consistency-restoring rules. In P. Doherty, J. McCarthy, and M.-A. Williams, editors, International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, pages 9\u201318, March 2003"},{"year":"2003","series-title":"Knowledge Representation, Reasoning and Declarative Problem Solving with Answer Sets","author":"Baral","key":"10.1016\/S1574-6526(07)03007-6_bib008"},{"key":"10.1016\/S1574-6526(07)03007-6_bib009","doi-asserted-by":"crossref","unstructured":"C. Baral, K. Chancellor, N. Tran, A. Joy, and M. Berens. A knowledge based approach for representing and reasoning about cell signalling networks. In Proceedings of European Conference on Computational Biology, Supplement on Bioinformatics, pages 15\u201322, 2004","DOI":"10.1093\/bioinformatics\/bth918"},{"key":"10.1016\/S1574-6526(07)03007-6_bib010","unstructured":"C. Baral, T. Eiter, and Y. Zhao. Using SAT and logic programming to design polynomial-time algorithms for planning in non-deterministic domains. In Proceedings of AAAI-05, pages 575\u2013583, 2005"},{"issue":"20","key":"10.1016\/S1574-6526(07)03007-6_bib011","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","article-title":"Logic programming and knowledge representation","volume":"19","author":"Baral","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(07)03007-6_bib012","series-title":"Workshop on Logic-Based Artificial Intelligence","article-title":"Reasoning agents in dynamic domains","author":"Baral","year":"2000"},{"key":"10.1016\/S1574-6526(07)03007-6_bib013","unstructured":"C. Baral and M. Gelfond. Reasoning about intended actions. In Proceedings of AAAI05, pages 689\u2013694, 2005"},{"key":"10.1016\/S1574-6526(07)03007-6_bib014","doi-asserted-by":"crossref","unstructured":"C. Baral, M. Gelfond, and N. Rushton. Probabilistic reasoning with answer sets. In Proceedings of LPNMR-7, January 2004","DOI":"10.1007\/978-3-540-24609-1_5"},{"key":"10.1016\/S1574-6526(07)03007-6_bib015","doi-asserted-by":"crossref","unstructured":"S. Baselice, P.A. Bonatti, and M. Gelfond. Towards an integration of answer set and constraint solving. In Proceedings of ICLP-05, pages 52\u201366, 2005","DOI":"10.1007\/11562931_7"},{"key":"10.1016\/S1574-6526(07)03007-6_bib016","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01530761","article-title":"Propositional semantics for disjunctive logic programs","volume":"12","author":"Ben-Eliyahu","year":"1994","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(07)03007-6_bib017","first-page":"86","article-title":"Negation by default and unstratifiable logic programs","volume":"79","author":"Bidoit","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1574-6526(07)03007-6_bib018","unstructured":"G. Brewka. Logic programming with ordered disjunction. In Proceedings of AAAI-02, pages 100\u2013105, 2002"},{"key":"10.1016\/S1574-6526(07)03007-6_bib019","series-title":"Proc. of 7th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR-04)","first-page":"34","article-title":"Answer sets: From constraint programming towards qualitative optimization","author":"Brewka","year":"2004"},{"key":"10.1016\/S1574-6526(07)03007-6_bib020","doi-asserted-by":"crossref","unstructured":"D.R. Brooks, E. Erdem, J.W. Minett, and D. Ringe. Character-based cladistics and answer set programming. In Proceedings of International Symposium on Practical Aspects of Declarative Languages, pages 37\u201351, 2005","DOI":"10.1007\/978-3-540-30557-6_5"},{"key":"10.1016\/S1574-6526(07)03007-6_bib021","doi-asserted-by":"crossref","unstructured":"F. Buccafurri, N. Leone, and P. Rullo. Adding weak constraints to disjunctive datalog. In Proceedings of the 1997 Joint Conference on Declarative Programming APPIA-GULP-PRODE'97, 1997","DOI":"10.1007\/3-540-63255-7_2"},{"issue":"3","key":"10.1016\/S1574-6526(07)03007-6_bib022","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","article-title":"Efficient top\u2013down computation of queries under the well-founded semantics","volume":"24","author":"Chen","year":"1995","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(07)03007-6_bib023","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S1574-6526(07)03007-6_bib024","unstructured":"A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un syst\u00e8me de communication homme\u2013machine en fran\u00e7ais. Technical report, Groupe de Intelligence Artificielle Universit\u00e9 de Aix-Marseille, 1973"},{"issue":"2","key":"10.1016\/S1574-6526(07)03007-6_bib025","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1111\/j.0824-7935.2004.00240.x","article-title":"A classification and survey of preference handling approaches in nonmonotonic reasoning","volume":"20","author":"Delgrande","year":"2004","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1574-6526(07)03007-6_bib026","series-title":"Proceedings of the 4th European Conference on Planning","first-page":"169","article-title":"Encoding planning problems in nonmonotonic logic programs","volume":"vol. 1348","author":"Dimopoulos","year":"1997"},{"issue":"3","key":"10.1016\/S1574-6526(07)03007-6_bib027","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/261124.261126","article-title":"Disjunctive Datalog","volume":"22","author":"Eiter","year":"1997","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S1574-6526(07)03007-6_bib028","unstructured":"T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining answer set programming with description logics for the semantic web. Technical Report INFSYS RR-1843-07-04, Institut f\u00fcr Informationssysteme, Technische Universit\u00e4t Wien, A-1040 Vienna, Austria, January 2007. Preliminary version appeared in Proc. KR 2004, pages 141\u2013151"},{"key":"10.1016\/S1574-6526(07)03007-6_bib029","series-title":"International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR97","first-page":"363","article-title":"A deductive system for nonmonotonic reasoning","volume":"vol. 1265","author":"Eiter","year":"1997"},{"key":"10.1016\/S1574-6526(07)03007-6_bib030","article-title":"Semantical characterizations and complexity of equivalences in answer set programming","author":"Eiter","year":"2006","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1574-6526(07)03007-6_bib031","doi-asserted-by":"crossref","unstructured":"I. Elkabani, E. Pontelli, and T.C. Son. Smodels with CLP and its applications: A simple and effective approach to aggregates in asp. In Proceedings of ICLP-04, pages 73\u201389, 2004","DOI":"10.1007\/978-3-540-27775-0_6"},{"key":"10.1016\/S1574-6526(07)03007-6_bib032","series-title":"In Proc. of 8th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2005)","first-page":"40","article-title":"Unfounded sets for disjunctive logic programs with arbitrary aggregates","volume":"vol. 3662","author":"Faber","year":"2005"},{"key":"10.1016\/S1574-6526(07)03007-6_bib033","doi-asserted-by":"crossref","unstructured":"W. Faber, N. Leone, and G. Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proceedings of the 8th European Conference on Artificial Intelligence (JELIA 2004), pages 200\u2013212, 2004","DOI":"10.1007\/978-3-540-30227-8_19"},{"issue":"1","key":"10.1016\/S1574-6526(07)03007-6_bib034","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"10.1016\/S1574-6526(07)03007-6_bib035","doi-asserted-by":"crossref","unstructured":"P. Ferraris. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 119\u2013131, 2005","DOI":"10.1007\/11546207_10"},{"key":"10.1016\/S1574-6526(07)03007-6_bib036","unstructured":"P. Ferraris, J. Lee, and V. Lifschitz. A new perspective on stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 372\u2013379, 2007"},{"key":"10.1016\/S1574-6526(07)03007-6_bib037","unstructured":"P. Ferraris and V. Lifschitz. Mathematical foundations of answer set programming. In We Will Show Them, Essays in Honour of Dov Gabbay, vol. 1, pages 615\u2013654. College Publications"},{"key":"10.1016\/S1574-6526(07)03007-6_bib038","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1017\/S1471068403001923","article-title":"Weight constraints as nested expressions","volume":"5","author":"Ferraris","year":"2005","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/S1574-6526(07)03007-6_bib039","series-title":"Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07)","first-page":"136","article-title":"Conflict-deriven answer set enumeration","volume":"vol. 3662","author":"Gebser","year":"2007"},{"issue":"3","key":"10.1016\/S1574-6526(07)03007-6_bib040","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Gelder","year":"1991","journal-title":"Journal of ACM"},{"key":"10.1016\/S1574-6526(07)03007-6_bib041","unstructured":"M. Gelfond. On stratified autoepistemic theories. In Proceedings of Sixth National Conference on Artificial Intelligence, pages 207\u2013212, 1987"},{"key":"10.1016\/S1574-6526(07)03007-6_bib042","unstructured":"M. Gelfond. Epistemic approach to formalization of commonsense reasoning. Technical Report TR-91-2, University of Texas at El Paso, 1991"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(07)03007-6_bib043","article-title":"Knowledge representation and logic programming","volume":"138","author":"Gelfond","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(07)03007-6_bib044","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of ICLP-88, pages 1070\u20131080, 1988"},{"issue":"3\u20134","key":"10.1016\/S1574-6526(07)03007-6_bib045","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"issue":"16","key":"10.1016\/S1574-6526(07)03007-6_bib046","first-page":"193","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on AI"},{"key":"10.1016\/S1574-6526(07)03007-6_bib047","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","article-title":"Answer set programming based on propositional satisfiability","volume":"36","author":"Giunchiglia","year":"2006","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1574-6526(07)03007-6_bib048","series-title":"Machine Intelligence 4","first-page":"463","article-title":"Some philosophical problems from the standpoint of artificial intelligence","author":"Hayes","year":"1969"},{"key":"10.1016\/S1574-6526(07)03007-6_bib049","series-title":"Proc. of 8th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2005)","first-page":"92","article-title":"Guarded open answer set programming","volume":"vol. 3662","author":"Heymans","year":"2005"},{"key":"10.1016\/S1574-6526(07)03007-6_bib050","unstructured":"T. Janhunen, I. Niemela, P. Simons, and J. You. Partiality and disjunction in stable model semantics. In Proceedings of the 2000 KR Conference, pages 411\u2013419, 2000"},{"key":"10.1016\/S1574-6526(07)03007-6_bib051","series-title":"Proc. of 8th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2004)","first-page":"336","article-title":"LPEQ and DLPEQ\u2014translators for automated equivalence testing of logic programs","volume":"vol. 2923","author":"Janhunen","year":"2004"},{"year":"1979","series-title":"Logic for Problem Solving","author":"Kowalski","key":"10.1016\/S1574-6526(07)03007-6_bib052"},{"issue":"4","key":"10.1016\/S1574-6526(07)03007-6_bib053","first-page":"319","article-title":"A logic-based calculus of events","volume":"4","author":"Kowalski","year":"1986","journal-title":"New Generation Computing"},{"key":"10.1016\/S1574-6526(07)03007-6_bib054","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","article-title":"The DLV system for knowledge representation and reasoning","volume":"7","author":"Leone","year":"2006","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1574-6526(07)03007-6_bib055","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2630","article-title":"Disjunctive stable models: Unfounded sets, fixpoint semantics and computation","volume":"135","author":"Leone","year":"1997","journal-title":"Information and Computation"},{"issue":"2","key":"10.1016\/S1574-6526(07)03007-6_bib056","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/1131313.1131316","article-title":"Why are there so many loop formulas?","volume":"7","author":"Lifschitz","year":"2006","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1574-6526(07)03007-6_bib057","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","article-title":"Strongly equivalent logic programs","volume":"2","author":"Lifschitz","year":"2001","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(07)03007-6_bib058","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","article-title":"ASSAT: Computing answer sets of a logic program by SAT solvers","volume":"157","author":"Lin","year":"2004","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(07)03007-6_bib059","first-page":"35","article-title":"General patterns in nonmonotonic reasoning","volume":"vol. 3","author":"Makinson","year":"1993"},{"key":"10.1016\/S1574-6526(07)03007-6_bib060","unstructured":"V.W. Marek and M. Truszczynski. Stable semantics for logic programs and default reasoning. In Proc. of the North American Conf. on Logic Programming, pages 243\u2013257, 1989"},{"year":"1993","series-title":"Nonmonotonic Logics; Context Dependent Reasoning","author":"Marek","key":"10.1016\/S1574-6526(07)03007-6_bib061"},{"key":"10.1016\/S1574-6526(07)03007-6_bib062","series-title":"The Logic Programming Paradigm: a 25-Year Perspective","first-page":"375","article-title":"Stable models and an alternative logic programming paradigm","author":"Marek","year":"1999"},{"key":"10.1016\/S1574-6526(07)03007-6_bib063","unstructured":"N. McCain and H. Turner. A causal theory of ramifications and qualifications. In Proceedings of IJCAI-95, pages 1978\u20131984, 1995"},{"key":"10.1016\/S1574-6526(07)03007-6_bib064","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014a form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"year":"1990","series-title":"Formalization of Common Sense","author":"McCarthy","key":"10.1016\/S1574-6526(07)03007-6_bib065"},{"key":"10.1016\/S1574-6526(07)03007-6_bib066","doi-asserted-by":"crossref","unstructured":"J. Minker. On indefinite data bases and the closed world assumption. In Proceedings of CADE-82, pages 292\u2013308, 1982","DOI":"10.1007\/BFb0000066"},{"key":"10.1016\/S1574-6526(07)03007-6_bib067","series-title":"Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter","first-page":"234","article-title":"Logic and databases: a 20 year retrospective","author":"Minker","year":"1999"},{"key":"10.1016\/S1574-6526(07)03007-6_bib068","series-title":"Proceedings of the 8th International Joint Conference on Artificial Intelligence","first-page":"272","article-title":"Semantical considerations on nonmonotonic logic","author":"Moore","year":"1983"},{"year":"2006","series-title":"Commonsense Reasoning","author":"Mueller","key":"10.1016\/S1574-6526(07)03007-6_bib069"},{"issue":"3\u20134","key":"10.1016\/S1574-6526(07)03007-6_bib070","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","article-title":"Logic programs with stable model semantics as a constraint programming paradigm","volume":"25","author":"Niemela","year":"1999","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S1574-6526(07)03007-6_bib071","series-title":"Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97)","first-page":"420","article-title":"Smodels\u2014an implementation of the stable model and well-founded semantics for normal logic programs","volume":"vol. 1265","author":"Niemela","year":"1997"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(07)03007-6_bib072","first-page":"181","article-title":"Extending and implementing the stable model semantics","volume":"138","author":"Niemela","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(07)03007-6_bib073","series-title":"Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97)","first-page":"420","article-title":"Smodels\u2014an implementation of the stable model and well-founded semantics for normal logic programs","volume":"vol. 1265","author":"Niemela","year":"1997"},{"key":"10.1016\/S1574-6526(07)03007-6_bib074","doi-asserted-by":"crossref","unstructured":"M. Nogueira, M. Balduccini, M. Gelfond, R. Watson, and M. Barry. An A-Prolog decision support system for the Space Shuttle. In PADL 2001, pages 169\u2013183, 2001","DOI":"10.1007\/3-540-45241-9_12"},{"key":"10.1016\/S1574-6526(07)03007-6_bib075","series-title":"Non-Monotonic Extension of Logic Programming","first-page":"57","article-title":"A new logical characterization of stable models and answer sets","volume":"vol. 1216","author":"Pearce","year":"1997"},{"key":"10.1016\/S1574-6526(07)03007-6_bib076","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S1471068406002973","article-title":"Well-founded and stable semantics of logic programs with aggregates","volume":"7","author":"Pelov","year":"2007","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/S1574-6526(07)03007-6_bib077","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive databases and logic programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/S1574-6526(07)03007-6_bib078","series-title":"Logic and Data Bases","first-page":"119","article-title":"On closed world data bases","author":"Reiter","year":"1978"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(07)03007-6_bib079","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"year":"2001","series-title":"Knowledge in Action\u2014Logical Foundations for Specifying and Implementing Dynamical Systems","author":"Reiter","key":"10.1016\/S1574-6526(07)03007-6_bib080"},{"issue":"2","key":"10.1016\/S1574-6526(07)03007-6_bib081","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/1055686.1055687","article-title":"Induction from answer sets in nonmonotonic logic programs","volume":"6","author":"Sakama","year":"2005","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1574-6526(07)03007-6_bib082","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","article-title":"Prioritized logic programming and its application to commonsense reasoning","volume":"123","author":"Sakama","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(07)03007-6_bib083","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0743-1066(90)90032-Z","article-title":"Completed logic programs and their consistency","volume":"9","author":"Sato","year":"1990","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(07)03007-6_bib084","unstructured":"J. Schlipf. Some remarks on computability and open domain semantics. In Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming of the International Logic Programming Symposium, 1993"},{"issue":"1","key":"10.1016\/S1574-6526(07)03007-6_bib085","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jcss.1995.1053","article-title":"The expressive powers of logic programming semantics","volume":"51","author":"Schlipf","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"year":"1997","series-title":"Solving the Frame Problem: A Mathematical Investigation of the Commonsense Law of Inertia","author":"Shanahan","key":"10.1016\/S1574-6526(07)03007-6_bib086"},{"key":"10.1016\/S1574-6526(07)03007-6_bib087","doi-asserted-by":"crossref","unstructured":"T. Soininen and I. Niemela. Developing a declarative rule language for applications in product configuration. In Proceedings of International Symposium on Practical Aspects of Declarative Languages, pages 305\u2013319, 1998","DOI":"10.1007\/3-540-49201-1_21"},{"key":"10.1016\/S1574-6526(07)03007-6_bib088","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S1471068406002936","article-title":"A constructive semantic characterization of aggregates in answer set programming","volume":"7","author":"Son","year":"2007","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/S1574-6526(07)03007-6_bib089","series-title":"Proc. of 8th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2005)","first-page":"172","article-title":"An approximation of action theories of and its application to conformant planning","volume":"vol. 3662","author":"Son","year":"2005"},{"key":"10.1016\/S1574-6526(07)03007-6_bib090","doi-asserted-by":"crossref","unstructured":"V.S. Subrahmanian and C. Zaniolo. Relating stable models and AI planning domains. In Proceedings of ICLP-95, pages 233\u2013247, 1995","DOI":"10.7551\/mitpress\/4298.003.0030"},{"issue":"1\u20133","key":"10.1016\/S1574-6526(07)03007-6_bib091","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0743-1066(96)00125-2","article-title":"Representing actions in logic programs and default theories: A situation calculus approach","volume":"31","author":"Turner","year":"1997","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"10.1016\/S1574-6526(07)03007-6_bib092","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1017\/S1471068401001144","article-title":"Order-consistent programs are cautiously monotonic","volume":"1","author":"Turner","year":"2001","journal-title":"Journal of Theory and Practice of Logic Programming (TPLP)"},{"issue":"2","key":"10.1016\/S1574-6526(07)03007-6_bib093","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01228882","article-title":"The Aditi deductive database system","volume":"3","author":"Vaghani","year":"1994","journal-title":"The VLDB Journal"}],"container-title":["Foundations of Artificial Intelligence","Handbook of Knowledge Representation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652607030076?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652607030076?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:52:49Z","timestamp":1761619969000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652607030076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780444522115"],"references-count":93,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(07)03007-6","relation":{},"ISSN":["1574-6526"],"issn-type":[{"type":"print","value":"1574-6526"}],"subject":[],"published":{"date-parts":[[2008]]}}}