{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:15:27Z","timestamp":1778670927446,"version":"3.51.4"},"reference-count":138,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T00:00:00Z","timestamp":1248998400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n\t  <jats:p>Equilibrium logic is an approach to non-monotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of <jats:italic>nested logic programs<\/jats:italic>, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs into <jats:italic>quantified propositional logic<\/jats:italic>, an extension of classical propositional logic where quantifications over atomic formulas are permitted. Thus, quantified propositional logic is a fragment of second-order logic, and its formulas are usually referred to as <jats:italic>quantified Boolean formulas<\/jats:italic> (QBFs). We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. In particular, our encodings map a given decision problem into some QBF such that the latter is valid precisely in case the former holds. The basic tasks we deal with here are the <jats:italic>consistency problem<\/jats:italic>, <jats:italic>brave reasoning<\/jats:italic> and <jats:italic>skeptical reasoning<\/jats:italic>. Additionally, we also provide encodings for testing equivalence of theories or programs under different notions of equivalence, viz. <jats:italic>ordinary<\/jats:italic>, <jats:italic>strong<\/jats:italic> and <jats:italic>uniform equivalence<\/jats:italic>. For all considered reasoning tasks, we analyse their computational complexity and give strict complexity bounds. Hereby, our encodings yield upper bounds in a direct manner. Besides this useful feature, our approach has the following benefits: First, our encodings yield a <jats:italic>uniform axiomatisation<\/jats:italic> for a variety of problems in a common language. Second, extant solvers for QBFs can be used as back-end inference engines to realise implementations of the encoded task in a rapid prototyping manner. Third, our axiomatisations also allow us to straightforwardly relate equilibrium logic with circumscription.<\/jats:p>","DOI":"10.1017\/s147106840999010x","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T13:58:11Z","timestamp":1249048691000},"page":"565-616","source":"Crossref","is-referenced-by-count":12,"title":["Characterising equilibrium logic and nested logic programs: Reductions and complexity<sup>,<\/sup>"],"prefix":"10.1017","volume":"9","author":[{"given":"DAVID","family":"PEARCE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HANS","family":"TOMPITS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEFAN","family":"WOLTRAN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2009,7,31]]},"reference":[{"key":"S147106840999010X_manual_ref-2","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.4.557"},{"key":"S147106840999010X_manual_ref-33","first-page":"242","volume-title":"Proceedings of the 18th International Conference on Logic Programming (ICLP 2001)","author":"Erdem","year":"2001"},{"key":"S147106840999010X_manual_ref-73","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018978005636"},{"key":"S147106840999010X_manual_ref-79","first-page":"701","volume-title":"Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005)","author":"Liu","year":"2005"},{"key":"S147106840999010X_manual_ref-4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530761"},{"key":"S147106840999010X_manual_ref-48","first-page":"230","volume-title":"Proceedings of the 2nd Conference on Principles of Knowledge Representation and Reasoning (KR '91)","author":"Gelfond","year":"1991"},{"key":"S147106840999010X_manual_ref-45","first-page":"207","volume-title":"Proceedings of 6th National Conference on Artificial Intelligence (AAAI '87)","author":"Gelfond","year":"1987"},{"key":"S147106840999010X_manual_ref-125","first-page":"81","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001)","author":"Turner","year":"2001"},{"key":"S147106840999010X_manual_ref-93","first-page":"458","volume-title":"Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007)","author":"Oetsch","year":"2007"},{"key":"S147106840999010X_manual_ref-44","first-page":"24","volume-title":"Proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2008)","author":"Gebser","year":"2008"},{"key":"S147106840999010X_manual_ref-123","first-page":"189","volume-title":"Proceedings of the 21st International Conference on Logic Programming (ICLP 2005)","author":"Tompits","year":"2005"},{"key":"S147106840999010X_manual_ref-31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45616-3_8"},{"key":"S147106840999010X_manual_ref-95","first-page":"10","volume-title":"Proceedings of the 11th International Workshop on Nonmonotonic Reasoning (NMR 2006)","author":"Oikarinen","year":"2006"},{"key":"S147106840999010X_manual_ref-82","first-page":"115","volume-title":"Proceedings of the 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning (LPNMR '93)","author":"Marek","year":"1993"},{"key":"S147106840999010X_manual_ref-114","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1952.11988183"},{"key":"S147106840999010X_manual_ref-36","first-page":"433","volume-title":"Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008)","author":"Faber","year":"2008"},{"key":"S147106840999010X_manual_ref-131","volume-title":"Principia Mathematica","author":"Whitehead","year":"1910"},{"key":"S147106840999010X_manual_ref-135","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068407003250"},{"key":"S147106840999010X_manual_ref-22","first-page":"214","volume-title":"Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2003). Selected Revised Papers","author":"Egly","year":"2004"},{"key":"S147106840999010X_manual_ref-117","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50021-X"},{"key":"S147106840999010X_manual_ref-69","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198537472.003.0006"},{"key":"S147106840999010X_manual_ref-10","first-page":"4","volume-title":"Proceedings of the 12th Portuguese Conference on Artificial Intelligence (EPIA 2005)","author":"Cabalar","year":"2005"},{"key":"S147106840999010X_manual_ref-62","first-page":"451","volume-title":"Proceedings of the 19th International Conference on Logic Programming (ICLP 2003)","author":"Lee","year":"2003"},{"key":"S147106840999010X_manual_ref-81","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50020-8"},{"key":"S147106840999010X_manual_ref-106","first-page":"388","volume-title":"Proceedings 16th European Conference on Artificial Intelligence (ECAI 2004)","author":"Pearce","year":"2004"},{"key":"S147106840999010X_manual_ref-41","first-page":"99","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","author":"Fink","year":"2008"},{"key":"S147106840999010X_manual_ref-96","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.06.012"},{"key":"S147106840999010X_manual_ref-132","unstructured":"Woltran, S. 2003. Quantified Boolean Formulas \u2013 From Theory to Practice. Ph.D. thesis, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme."},{"key":"S147106840999010X_manual_ref-76","first-page":"170","volume-title":"Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR 2002)","author":"Lin","year":"2002"},{"key":"S147106840999010X_manual_ref-85","first-page":"1","volume-title":"ACM Symposium on Theory of Computing (STOC '73)","author":"Meyer","year":"1973"},{"key":"S147106840999010X_manual_ref-99","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9309-0_8"},{"key":"S147106840999010X_manual_ref-72","first-page":"101","volume-title":"Proceedings of the 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning (LPNMR '93)","author":"Lifschitz","year":"1993"},{"key":"S147106840999010X_manual_ref-103","doi-asserted-by":"publisher","DOI":"10.1007\/10722086_28"},{"key":"S147106840999010X_manual_ref-30","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"S147106840999010X_manual_ref-115","doi-asserted-by":"publisher","DOI":"10.1613\/jair.591"},{"key":"S147106840999010X_manual_ref-100","first-page":"210","volume-title":"Proceedings of the 20th International Conference on Logic Programming (ICLP 2004)","author":"Pearce","year":"2004"},{"key":"S147106840999010X_manual_ref-105","first-page":"306","volume-title":"Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA 2001)","author":"Pearce","year":"2001"},{"key":"S147106840999010X_manual_ref-91","volume-title":"Proceedings of the 16th International Conference on Computing (CIC 2007)","author":"Oetsch","year":"2007"},{"key":"S147106840999010X_manual_ref-28","doi-asserted-by":"publisher","DOI":"10.1145\/1243996.1244000"},{"key":"S147106840999010X_manual_ref-98","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023801"},{"key":"S147106840999010X_manual_ref-136","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90062-1"},{"key":"S147106840999010X_manual_ref-66","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45616-3_12"},{"key":"S147106840999010X_manual_ref-87","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90083-1"},{"key":"S147106840999010X_manual_ref-78","first-page":"225","volume-title":"Proceedings of the 20th International Conference on Logic Programming (ICLP 2004)","author":"Linke","year":"2004"},{"key":"S147106840999010X_manual_ref-65","doi-asserted-by":"publisher","DOI":"10.4064\/fm-14-1-1-81"},{"key":"S147106840999010X_manual_ref-101","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9028-z"},{"key":"S147106840999010X_manual_ref-80","first-page":"30","article-title":"Untersuchungen \u00fcber den Aussagenkalk\u00fcl","volume":"23","author":"\u0141ukasiewicz","year":"1930","journal-title":"Comptes Rendus S\u00e9ances Soci\u00e9t\u00e9 des Sciences et Lettres Varsovie"},{"key":"S147106840999010X_manual_ref-67","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_44"},{"key":"S147106840999010X_manual_ref-111","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90003-3"},{"key":"S147106840999010X_manual_ref-130","first-page":"689","article-title":"A constructive propositional calculus with strong negation (in Russian)","volume":"85","author":"Vorob'ev","year":"1952","journal-title":"Doklady Akademii Nauk SSR"},{"key":"S147106840999010X_manual_ref-58","first-page":"358","volume-title":"Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004)","author":"Janhunen","year":"2004"},{"key":"S147106840999010X_manual_ref-9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068407003110"},{"key":"S147106840999010X_manual_ref-137","first-page":"859","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003)","author":"You","year":"2003"},{"key":"S147106840999010X_manual_ref-24","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_42"},{"key":"S147106840999010X_manual_ref-138","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881912"},{"key":"S147106840999010X_manual_ref-32","first-page":"97","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)","author":"Eiter","year":"2005"},{"key":"S147106840999010X_manual_ref-54","first-page":"42","volume-title":"Sitzungsberichte der Preussischen Akademie der Wissenschaften","author":"Heyting","year":"1930"},{"key":"S147106840999010X_manual_ref-14","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_43"},{"key":"S147106840999010X_manual_ref-53","doi-asserted-by":"publisher","DOI":"10.1007\/BF02121114"},{"key":"S147106840999010X_manual_ref-1","first-page":"8","volume-title":"Proceedings of the 11th European Conference on Logics in Artificial Intelligence (JELIA 2008)","author":"Aguado","year":"2008"},{"key":"S147106840999010X_manual_ref-23","first-page":"477","volume-title":"Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006)","author":"Egly","year":"2006"},{"key":"S147106840999010X_manual_ref-121","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"S147106840999010X_manual_ref-89","first-page":"502","volume-title":"Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA 2006)","author":"Oetsch","year":"2006"},{"key":"S147106840999010X_manual_ref-107","first-page":"194","volume-title":"Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004)","author":"Pearce","year":"2004"},{"key":"S147106840999010X_manual_ref-84","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"S147106840999010X_manual_ref-42","volume-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"S147106840999010X_manual_ref-75","unstructured":"Lin, F. 1991. A Study of Nonmonotonic Reasoning. Ph.D. thesis, Stanford University, California."},{"key":"S147106840999010X_manual_ref-15","volume-title":"Introduction to Mathematical Logic, Volume I","author":"Church","year":"1956"},{"key":"S147106840999010X_manual_ref-127","first-page":"734","volume-title":"Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004)","author":"Valverde","year":"2004"},{"key":"S147106840999010X_manual_ref-5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30597-2_4"},{"key":"S147106840999010X_manual_ref-55","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(97)10001-2"},{"key":"S147106840999010X_manual_ref-26","first-page":"447","volume-title":"Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004)","author":"Eiter","year":"2004"},{"key":"S147106840999010X_manual_ref-38","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_10"},{"key":"S147106840999010X_manual_ref-110","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0038700"},{"key":"S147106840999010X_manual_ref-120","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5736-0"},{"key":"S147106840999010X_manual_ref-126","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001819"},{"key":"S147106840999010X_manual_ref-86","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90042-6"},{"key":"S147106840999010X_manual_ref-6","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_5"},{"key":"S147106840999010X_manual_ref-77","first-page":"112","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002)","author":"Lin","year":"2002"},{"key":"S147106840999010X_manual_ref-116","doi-asserted-by":"publisher","DOI":"10.2307\/2369962"},{"key":"S147106840999010X_manual_ref-97","volume-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"S147106840999010X_manual_ref-104","first-page":"405","volume-title":"Proceedings of the 19th International Conference on Logic Programming (ICLP 2002)","author":"Pearce","year":"2002"},{"key":"S147106840999010X_manual_ref-118","first-page":"361","volume-title":"Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004)","author":"Sarsakov","year":"2004"},{"key":"S147106840999010X_manual_ref-17","first-page":"304","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007)","author":"de Bruijn","year":"2007"},{"key":"S147106840999010X_manual_ref-34","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001765"},{"key":"S147106840999010X_manual_ref-83","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90011-9"},{"key":"S147106840999010X_manual_ref-122","first-page":"89","article-title":"Expressing default abduction problems as quantified Boolean formulas","volume":"16","author":"Tompits","year":"2003","journal-title":"AI Communications"},{"key":"S147106840999010X_manual_ref-128","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5203-4_4"},{"key":"S147106840999010X_manual_ref-27","first-page":"87","volume-title":"Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004)","author":"Eiter","year":"2004"},{"key":"S147106840999010X_manual_ref-46","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S147106840999010X_manual_ref-51","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00373-9"},{"key":"S147106840999010X_manual_ref-134","unstructured":"Woltran, S. 2005. Answer set programming: Model applications and proofs-of-concept. Tech. Rep. WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004). Available at http:\/\/www.kr.tuwien.ac.at\/research\/projects\/WASP\/."},{"key":"S147106840999010X_manual_ref-8","doi-asserted-by":"publisher","DOI":"10.1111\/j.0824-7935.2004.00241.x"},{"key":"S147106840999010X_manual_ref-119","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S147106840999010X_manual_ref-113","first-page":"561","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","author":"P\u00fchrer","year":"2008"},{"key":"S147106840999010X_manual_ref-37","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Methods of Logic in Computer Science"},{"key":"S147106840999010X_manual_ref-20","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1996-281205"},{"key":"S147106840999010X_manual_ref-57","first-page":"93","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001)","author":"Janhunen","year":"2001"},{"key":"S147106840999010X_manual_ref-63","first-page":"472","volume-title":"Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI 2008)","author":"Lee","year":"2008"},{"key":"S147106840999010X_manual_ref-19","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.6.801"},{"key":"S147106840999010X_manual_ref-50","doi-asserted-by":"publisher","DOI":"10.1002\/int.4550050507"},{"key":"S147106840999010X_manual_ref-25","first-page":"224","volume-title":"Proceedings of the 19th International Conference on Logic Programming (ICLP 2003)","author":"Eiter","year":"2003"},{"key":"S147106840999010X_manual_ref-64","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S147106840999010X_manual_ref-29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536399"},{"key":"S147106840999010X_manual_ref-133","first-page":"161","volume-title":"Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004)","author":"Woltran","year":"2004"},{"key":"S147106840999010X_manual_ref-16","first-page":"127","volume-title":"Logic and Data Bases","author":"Clark","year":"1978"},{"key":"S147106840999010X_manual_ref-21","first-page":"417","volume-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000)","author":"Egly","year":"2000"},{"key":"S147106840999010X_manual_ref-92","first-page":"591","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","author":"Oetsch","year":"2008"},{"key":"S147106840999010X_manual_ref-56","first-page":"174","volume-title":"Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004)","author":"Inoue","year":"2004"},{"key":"S147106840999010X_manual_ref-35","first-page":"430","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)","author":"Faber","year":"2005"},{"key":"S147106840999010X_manual_ref-43","first-page":"244","volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006)","author":"Gebser","year":"2006"},{"key":"S147106840999010X_manual_ref-94","first-page":"180","volume-title":"Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004)","author":"Oikarinen","year":"2004"},{"key":"S147106840999010X_manual_ref-124","first-page":"560","volume-title":"Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI 2008)","author":"Truszczy\u0144ski","year":"2008"},{"key":"S147106840999010X_manual_ref-52","unstructured":"G\u00f6del, K. 1932. Zum intuitionistischen Aussagenkalk\u00fcl. Anzeiger der Akademie der Wissenschaften in Wien, 65\u201366."},{"key":"S147106840999010X_manual_ref-39","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9025-2"},{"key":"S147106840999010X_manual_ref-70","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S147106840999010X_manual_ref-108","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-005-8473-8"},{"key":"S147106840999010X_manual_ref-12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75867-9_31"},{"key":"S147106840999010X_manual_ref-109","first-page":"546","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","author":"Pearce","year":"2008"},{"key":"S147106840999010X_manual_ref-71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_17"},{"key":"S147106840999010X_manual_ref-60","first-page":"648","article-title":"The calculus of the weak \u201claw of excluded middle\u201d","volume":"8","author":"Kowalski","year":"1968","journal-title":"Mathematics of the USSR"},{"key":"S147106840999010X_manual_ref-74","first-page":"23","volume-title":"Proceedings of the 11th International Conference on Logic Programming (ICLP '94)","author":"Lifschitz","year":"1994"},{"key":"S147106840999010X_manual_ref-47","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-1453-5.50018-0"},{"key":"S147106840999010X_manual_ref-3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S147106840999010X_manual_ref-88","doi-asserted-by":"publisher","DOI":"10.2307\/2268973"},{"key":"S147106840999010X_manual_ref-102","first-page":"688","volume-title":"Proceedings of the 1st International Conference on Computational Logic (CL 2000)","author":"Pearce","year":"2000"},{"key":"S147106840999010X_manual_ref-7","first-page":"100","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002)","author":"Brewka","year":"2002"},{"key":"S147106840999010X_manual_ref-40","first-page":"372","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007)","author":"Ferraris","year":"2007"},{"key":"S147106840999010X_manual_ref-129","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"S147106840999010X_manual_ref-112","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037171"},{"key":"S147106840999010X_manual_ref-11","first-page":"104","volume-title":"Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007)","author":"Cabalar","year":"2007"},{"key":"S147106840999010X_manual_ref-61","first-page":"503","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)","author":"Lee","year":"2005"},{"key":"S147106840999010X_manual_ref-18","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840200159X"},{"key":"S147106840999010X_manual_ref-13","first-page":"132","volume-title":"Proceedings of the 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning (LPNMR '93)","author":"Chen","year":"1993"},{"key":"S147106840999010X_manual_ref-59","first-page":"493","volume-title":"Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA 2002)","author":"Janhunen","year":"2002"},{"key":"S147106840999010X_manual_ref-68","first-page":"235","volume-title":"Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR '89)","author":"Lifschitz","year":"1989"},{"key":"S147106840999010X_manual_ref-49","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90068-4"},{"key":"S147106840999010X_manual_ref-90","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.2006.29"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106840999010X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T20:50:41Z","timestamp":1750452641000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106840999010X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,31]]},"references-count":138,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["S147106840999010X"],"URL":"https:\/\/doi.org\/10.1017\/s147106840999010x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,31]]}}}