{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:04:38Z","timestamp":1760169878353},"reference-count":127,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4100,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0004-3702(02)00207-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:01:41Z","timestamp":1034600501000},"page":"3-38","source":"Crossref","is-referenced-by-count":107,"title":["Logic programming and knowledge representation\u2014The A-Prolog perspective"],"prefix":"10.1016","volume":"138","author":[{"given":"Michael","family":"Gelfond","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00207-2_BIB001","series-title":"Reasoning with Logic Programming","author":"Alferes","year":"1996"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB002","doi-asserted-by":"crossref","unstructured":"J.J. Alferes, L.M. Pereira, H. Przymusinska, T.C. Przymusinski, LUPS\u2014A language for updating logic programs, Artificial Intelligence 138 (2002) 87\u2013116, this issue","DOI":"10.1016\/S0004-3702(02)00183-2"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB003","series-title":"From Logic Programming to Prolog","author":"Apt","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB004","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\/S0004-3702(02)00207-2_BIB005","series-title":"Proc. Internat. Conference on Theoretical Aspects of Computer Software","first-page":"265","article-title":"Proving termination in general prolog programs","volume":"526","author":"Apt","year":"1991"},{"issue":"3","key":"10.1016\/S0004-3702(02)00207-2_BIB006","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/177492.177673","article-title":"On the occur-check free logic programs","volume":"16","author":"Apt","year":"1994","journal-title":"ACM Trans. Program. Language Systems"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB007","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","article-title":"Logic Programming and negation: A survey","volume":"19\u201320","author":"Apt","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB008","author":"Baral"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB009","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","article-title":"Logic programming and knowledge representation","volume":"19,20","author":"Baral","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB010","series-title":"Logic Based AI","first-page":"257","article-title":"Reasoning agents in dynamic domains","author":"Baral","year":"2000"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB011","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":"Ann. Math. Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB012","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(91)90073-B","article-title":"General logical databases and programs: Default logic semantics and stratification","volume":"91","author":"Bidoit","year":"1991","journal-title":"J. Inform. Comput."},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB013","first-page":"86","article-title":"Negation by default and unstratifiable logic programs","volume":"79","author":"Bidoit","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(02)00207-2_BIB014","series-title":"Proc. 8th International Workshop on Non-Monotonic Reasoning, Breckeridge, CO","article-title":"Fages' theorem and answer set programming","author":"Babovich","year":"2000"},{"issue":"2","key":"10.1016\/S0004-3702(02)00207-2_BIB015","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0743-1066(97)00073-3","article-title":"Tabulated resolution for the well-founded semantics","volume":"34","author":"Bol","year":"1998","journal-title":"J. Logic Programming"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00207-2_BIB016","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","article-title":"An abstract, argumentation-theoretic approach to default reasoning","volume":"93","author":"Bondarenko","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB017","series-title":"Nonmonotonic Reasoning: An Overview","author":"Brewka","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB018","doi-asserted-by":"crossref","unstructured":"M. Cadoli, T. Eiter, G. Gottlob, Default logic as a query language, IEEE Trans. Knowledge Data Engrg. 9 (3) 448\u2013463","DOI":"10.1109\/69.599933"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB019","unstructured":"F. Calimeri, W. Faber, N. Leone, G. Pfeifer, Pruning operators for answer set programming systems, DBAI-TR-01-10, Institut f\u00fcr Informationssysteme, Technische Universit\u00e4t Wien, Austria, April, 2001"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB020","series-title":"Proc. Second Internat. Workshop on Logic Programming and Nonmonotonic Reasoning, Lisbon","first-page":"132","article-title":"Minimal knowledge + negation as failure = only knowing (sometimes)","author":"Chen","year":"1993"},{"issue":"3","key":"10.1016\/S0004-3702(02)00207-2_BIB021","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","article-title":"Efficient top-down computation of queries under the well-founded semantics","volume":"24","author":"Chen","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB022","series-title":"Proc. Internat. Conference on Principles of Knowledge Representation and Reasoning","first-page":"518","article-title":"Default reasoning system DeReSe","author":"Cholewinski","year":"1996"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB023","unstructured":"A. Colmerauer, H. Kanoui, R. Pasero, P. Roussel, Un systeme de communication homme-machine en Francais, Technical Report, Groupe de Intelligence Artificielle Universit\u00e9 de Aix-Marseilles II, Marseilles, 1973"},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB024","first-page":"13","article-title":"Project report on LP+: A second generation logic programming language","volume":"13","author":"De Schreye","year":"2000","journal-title":"AI Comm."},{"key":"10.1016\/S0004-3702(02)00207-2_BIB025","series-title":"Proc. International Workshop in Logic Programming and Non-Monotonic Reasoning, Washington, DC","first-page":"166","article-title":"Classifying semantics of logic programs","author":"Dix","year":"1991"},{"issue":"2","key":"10.1016\/S0004-3702(02)00207-2_BIB026","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(95)00118-2","article-title":"Completeness of SLDNF-resolution for nonfloundering queries","volume":"27","author":"Drabent","year":"1996","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB027","series-title":"Proc. 4th Logic Programming and Non-Monotonic Reasoning Conference (LPNMR-97)","first-page":"363","article-title":"A deductive system for nonmonotonic reasoning","volume":"1265","author":"Eiter","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB028","series-title":"Logic Based AI","first-page":"79","article-title":"Declarative problem solving using the dlv system","author":"Eiter","year":"2000"},{"issue":"3","key":"10.1016\/S0004-3702(02)00207-2_BIB029","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 Trans. Database Systems"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB030","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB031","doi-asserted-by":"crossref","unstructured":"B. Cui, T. Swift, Preference Logic grammars: Semantics, standardization, and application to data standardization, Artificial Intelligence 138 (2002) 117\u2013147, this issue","DOI":"10.1016\/S0004-3702(02)00185-6"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB032","series-title":"Recent Advances in AI Planning, Proc. 4th European Conference on Planning, ECP-97","first-page":"169","article-title":"Encoding planning problems in nonmonotonic logic programs","volume":"1348","author":"Dimopoulos","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB033","series-title":"Proc. 8th International Workshop on Nonmonotonic Reasoning (NMR-2000), Breckenridge, CO","article-title":"dcs: An implementation of DATALOG with Constraints","author":"East","year":"2000"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB034","series-title":"Proc. AAAI-00 2000, Austin, TX","first-page":"417","article-title":"Solving advanced reasoning tasks using quantified boolean formulas","author":"Egly","year":"2000"},{"issue":"3\u20134","key":"10.1016\/S0004-3702(02)00207-2_BIB035","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","article-title":"On the computational cost of disjunctive logic programming: Propositional case","volume":"15","author":"Eiter","year":"1995","journal-title":"Ann. Math. Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00207-2_BIB036","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0304-3975(97)00129-1","article-title":"Expressive power and complexity of partial models for disjunctive deductive databases","volume":"206","author":"Eiter","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(02)00207-2_BIB037","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0004-3702(90)90086-F","article-title":"A rational reconstruction of nonmonotonic truth maintenance systems","volume":"43","author":"Elkan","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB038","series-title":"Proc. AAAI-90, Boston, MA","first-page":"272","article-title":"Computing stable models by using the ATMS","author":"Esghi","year":"1990"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB039","series-title":"Proc. CL-2000","first-page":"822","article-title":"Wire routing and satisfiability planning","author":"Erdem","year":"2000"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB040","series-title":"Proc. 7th International Workshop on Deductive Databases and Logic Programming (DDLP-99), Japan","first-page":"135","article-title":"Using database optimization techniques for nonmonotonic reasoning","author":"Faber","year":"1999"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB041","series-title":"Proc. 5th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-99), El Paso, TX","first-page":"177","article-title":"Pushing goal derivation in DLP computations","volume":"1730","author":"Faber","year":"1999"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB042","series-title":"Proc. IJCAI-01, Seattle, WA","first-page":"635","article-title":"Experimenting with heuristics for answer set programming","author":"Faber","year":"2001"},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB043","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"J. Methods Logic Comput. Sci."},{"issue":"4","key":"10.1016\/S0004-3702(02)00207-2_BIB044","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke\u2013Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB045","series-title":"Proc. LPAR-01, Cuba","article-title":"Census data repair: A challenging application of disjunctive logic programming","author":"Franconi","year":"2001"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB046","series-title":"Proc. NATO Advanced Study Institute on Logics and Models of Concurrent Systems, La Colle-sur-Loup, France","first-page":"439","article-title":"Theoretical foundations for nonmonotonic reasoning in expert systems","author":"Gabbay","year":"1985"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB047","series-title":"Logic Programming: Proc. Seventh International Conference","first-page":"427","article-title":"Generalized stable models, truth maintenance and conflict resolution","author":"Giordano","year":"1990"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB048","series-title":"Proc. AAAI-87, Seattle, WA","first-page":"207","article-title":"On stratified autoepistemic theories","author":"Gelfond","year":"1987"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB049","series-title":"Logic Programming: Proc. Fifth Internat. Conference and Symposium","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB050","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","author":"Gelfond","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/S0004-3702(02)00207-2_BIB051","doi-asserted-by":"crossref","unstructured":"M. Gelfond, V. Lifschitz, Representing actions and change by logic programs, J. Logic Programming 17, 301\u2013323","DOI":"10.1016\/0743-1066(93)90035-F"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB052","first-page":"164","article-title":"Reasoning with prioritized defaults","volume":"1471","author":"Gelfond","year":"1998"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB053","series-title":"Proc. International Logic Programming Symposium (ILPS-94), Ithaca, NY","first-page":"23","article-title":"Complexity and expressive power of disjunctive logic programming","author":"Gottlob","year":"1994"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB054","doi-asserted-by":"crossref","unstructured":"G. Gottlob, F. Scarcello, M. Sideri, Fixed-parameter complexity in AI and nonmonotonic reasoning, Artificial Intelligence 130 (2002) 55\u201386, this issue","DOI":"10.1016\/S0004-3702(02)00182-0"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB055","series-title":"Machine Intelligence, Vol. 4","first-page":"183","article-title":"Theorem proving by resolution as a basis for question\u2014Answering systems","author":"Green","year":"1969"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB056","series-title":"Proc. Second Symposium on Mathematical Foundations of Computer Science","first-page":"105","article-title":"Computation and deduction","author":"Hayes","year":"1973"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB057","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5","first-page":"235","article-title":"The role of abduction in logic programming","author":"Kakas","year":"1998"},{"issue":"2","key":"10.1016\/S0004-3702(02)00207-2_BIB058","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/S0004-3702(97)00058-1","article-title":"A note on the stable model semantics of logic programs","volume":"96","author":"Kaminski","year":"1997","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(02)00207-2_BIB059","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0004-3702(94)00035-Y","article-title":"A comparative study of open default theories","volume":"77","author":"Kaminski","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB060","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"70","article-title":"Stable model checking made easy","author":"Koch","year":"1999"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB061","series-title":"Information Processing 74, Proceedings of IFIP Congress 74, Stockholm, Sweden","first-page":"569","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB062","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"issue":"4","key":"10.1016\/S0004-3702(02)00207-2_BIB063","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/S0004-3702(02)00207-2_BIB064","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed data dependencies in logic programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB065","series-title":"Proc. KR-89, Toronto, ON","first-page":"212","article-title":"What does a conditional knowledge base entail?","author":"Lehmann","year":"1989"},{"issue":"2","key":"10.1016\/S0004-3702(02)00207-2_BIB066","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":"Inform. and Comput."},{"key":"10.1016\/S0004-3702(02)00207-2_BIB067","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"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB068","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"177","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB069","series-title":"Computational Logic: Symposium Proceedings","first-page":"80","article-title":"On open defaults","author":"Lifschitz","year":"1990"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB070","series-title":"Proc. Second Internat. Workshop on Logic Programming and Non-Monotonic Reasoning, Lisbon","first-page":"101","article-title":"Extended logic programs as autoepistemic theories","author":"Lifschitz","year":"1993"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB071","series-title":"Principles of Knowledge Representation","first-page":"69","article-title":"Foundations of logic programming","author":"Lifschitz","year":"1996"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB072","doi-asserted-by":"crossref","unstructured":"V. Lifschitz, Answer set programming and plan generation, Artificial Intelligence 138 (2002) 39\u201354, this issue","DOI":"10.1016\/S0004-3702(02)00186-8"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB073","series-title":"The Handbook on Logic in AI and Logic Programming, Vol. 3","first-page":"298","article-title":"Circumscription","author":"Lifschitz","year":"1994"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB074","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","year":"1992"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB075","series-title":"The Handbook on Logic in AI and Logic Programming, Vol. 3","first-page":"35","article-title":"General patterns in nonmonotonic reasoning","author":"Makinson","year":"1993"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB076","doi-asserted-by":"crossref","unstructured":"V. Marek, I. Pivkina, M. Truszczy\u0144ski, Annotated revision programs, Artificial Intelligence 138 (2002) 149\u2013180, this issue","DOI":"10.1016\/S0004-3702(02)00184-4"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB077","series-title":"Proc. Sixth Internat. Conference on Logic Programming, Lisbon, Portugal","first-page":"600","article-title":"The relationship between logic program semantics and nonmonotonic reasoning","author":"Marek","year":"1989"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB078","series-title":"Proc. North American Conference on Logic Programming, Cleveland, OH","first-page":"243","article-title":"Stable semantics for logic programs and default reasoning","author":"Marek","year":"1989"},{"issue":"38","key":"10.1016\/S0004-3702(02)00207-2_BIB079","first-page":"588","article-title":"Autoepistemic logic","volume":"3","author":"Marek","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB080","series-title":"Proc. Second Internat. Workshop on Logic Programming and Non-Monotonic Reasoning, Lisbon","first-page":"115","article-title":"Reflexive autoepistemic logic and logic programming","author":"Marek","year":"1993"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB081","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\/S0004-3702(02)00207-2_BIB082","series-title":"Nonmonotonic Logic","author":"Marek","year":"1993"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB083","series-title":"Proc. Teddington Conference on the Mechanization of Thought Processes, Her Majesty's Stationery Office, London","first-page":"75","article-title":"Programs with common sense","author":"McCarthy","year":"1959"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB084","series-title":"Machine Intelligence, Vol. 4","first-page":"463","article-title":"Some philosophical problems from the standpoint of artificial intelligence","author":"McCarthy","year":"1969"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00207-2_BIB085","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014A form of nonmonotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(02)00207-2_BIB086","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Applications of circumscription to formalizing common sense knowledge","volume":"26","author":"McCarthy","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB087","series-title":"Proc. Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy","first-page":"212","article-title":"Satisfiability planning with causal theories","author":"McCain","year":"1998"},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB088","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","article-title":"Nonmonotonic logic II: Nonmonotonic modal theories","volume":"29","author":"McDermott","year":"1982","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00207-2_BIB089","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","article-title":"Nonmonotonic logic I","volume":"13","author":"McDermott","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB090","series-title":"Proc. CADE-82, New York","first-page":"292","article-title":"On indefinite data bases and the closed world assumption","author":"Minker","year":"1982"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB091","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01530759","article-title":"Overview of disjunctive logic programming","volume":"12","author":"Minker","year":"1994","journal-title":"Ann. Math Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB092","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\/S0004-3702(02)00207-2_BIB093","series-title":"Logic-Based Artificial Intelligence","year":"2000"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB094","doi-asserted-by":"crossref","unstructured":"M. Minsky, A framework for representing knowledge, in: P. Winston (Ed.), The Psychology of Computer Vision, McGraw-Hill, New York, pp. 211\u2013277","DOI":"10.1016\/B978-1-4832-1446-7.50018-2"},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB095","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantical considerations on nonmonotonic logic","volume":"25","author":"Moore","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB096","doi-asserted-by":"crossref","first-page":"16","DOI":"10.2307\/2268973","article-title":"Constructible falsity","volume":"14","author":"Nelson","year":"1949","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB097","series-title":"Logic for Applications","author":"Nerode","year":"1997"},{"issue":"3\u20134","key":"10.1016\/S0004-3702(02)00207-2_BIB098","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":"Niemel\u00e4","year":"1999","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB099","series-title":"Proc. 4th International Conference on Logic Programming and Non-Monotonic Reasoning, Dagstuhl, Germany","first-page":"421","article-title":"Smodels\u2014An implementation of the stable model and well-founded semantics for normal logic programs","author":"Niemel\u00e4","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB100","series-title":"Practical Aspects of Declarative Languages","first-page":"305","article-title":"Developing a declarative rule language for applications in program configuration","volume":"1551","author":"Soininen","year":"1999"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB101","author":"Nilsson"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB102","series-title":"Proc. Third International Symposium on Practical Aspects of Declarative Languages","first-page":"169","article-title":"A-Prolog decision support system for the Space Shuttle","volume":"1990","author":"Nogueira","year":"2001"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB103","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB104","unstructured":"D. Pearce, G. Wagner, Reasoning with negative information 1\u2014Strong negation in logic programming, Technical Report, Gruppe fur Logic, Wissentheorie and Information, Freie Universit\u00e4t Berlin, 1989"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB105","series-title":"Nonmonotonic Extensions of Logic Programming","first-page":"57","article-title":"A new logical characterization of stable models and answer sets","volume":"1216","author":"Pearce","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB106","series-title":"What is Negation?","article-title":"From here to there: Stable negation in logic programming","author":"Pearce","year":"1999"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB107","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\/S0004-3702(02)00207-2_BIB108","series-title":"Proc. 8th Symposium on Principles of Database Systems, Philadelphia, PA","first-page":"11","article-title":"Every logic program has a natural stratification and an iterated fixed point model","author":"Przymusinski","year":"1989"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB109","series-title":"Proc. 5th International Conference and Symposium on Logic Programming, Seattle, WA","first-page":"1106","article-title":"Weakly perfect model semantics for logic programs","author":"Przymusinska","year":"1988"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB110","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\/S0004-3702(02)00207-2_BIB111","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"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB112","series-title":"Proc. AAAI-82, Pittsburgh, PA","first-page":"418","article-title":"Circumscription implies predicate completion (sometimes)","author":"Reiter","year":"1982"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB113","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90019-Y","article-title":"A procedural semantics for well-founded negation in logic programs","volume":"13","author":"Ross","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB114","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":"J. Logic Programming"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00207-2_BIB115","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\/S0004-3702(02)00207-2_BIB116","series-title":"Solving the Frame Problem: A Mathematical Investigation of the Commonsense Law of Inertia","author":"Shanahan","year":"1997"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB117","series-title":"Logic Programming and Nonmonotonic Reasoning: Proc. First Internat. Workshop","first-page":"260","article-title":"Autoepistemic logic of knowledge","author":"Schwarz","year":"1991"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB118","doi-asserted-by":"crossref","unstructured":"P. Simons, I. Niemel\u00e4, T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence 138 (2002) 181\u2013234, this issue","DOI":"10.1016\/S0004-3702(02)00187-X"},{"issue":"1","key":"10.1016\/S0004-3702(02)00207-2_BIB119","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2273858","article-title":"Classifying the computational complexity of problems","volume":"52","author":"Stockmeyer","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB120","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0743-1066(14)80003-4","article-title":"A completeness result for SLDNF-resolution","volume":"15","author":"Stroetman","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00207-2_BIB121","series-title":"Proc. 2nd International Logic Programming Conference, Uppsala, Sweden","first-page":"127","article-title":"Unfold\/fold transformation of logic programs","author":"Tamaki","year":"1984"},{"issue":"1\u20133","key":"10.1016\/S0004-3702(02)00207-2_BIB122","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","volume":"31","author":"Turner","year":"1997","journal-title":"J. Logic Programming"},{"issue":"4","key":"10.1016\/S0004-3702(02)00207-2_BIB123","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":"Theory and Practice of Logic Programming"},{"issue":"4","key":"10.1016\/S0004-3702(02)00207-2_BIB124","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":"J. ACM"},{"issue":"3","key":"10.1016\/S0004-3702(02)00207-2_BIB125","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/S0004-3702(02)00207-2_BIB126","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1093\/logcom\/1.6.835","article-title":"Logic programming with strong negation and inexact predicates","volume":"1","author":"Wagner","year":"1991","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(02)00207-2_BIB127","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0022-0000(05)80053-4","article-title":"A three-valued semantics for deductive databases and logic programs","volume":"49","author":"You","year":"1994","journal-title":"J. Comput. System Sci."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:20:44Z","timestamp":1556727644000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":127,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0004370202002072"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00207-2","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}