{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:35Z","timestamp":1742913695646,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208317"},{"type":"electronic","value":"9783642208324"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20832-4_2","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T02:59:49Z","timestamp":1303959589000},"page":"12-32","source":"Crossref","is-referenced-by-count":2,"title":["Answer Set Programming\u2019s Contributions to Classical Logic"],"prefix":"10.1007","author":[{"given":"Marc","family":"Denecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost","family":"Vennekens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanne","family":"Vlaeminck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Wittocx","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"2_CR2","unstructured":"Baral, C., Gelfond, M., Kosheleva, O.: Approximating general logic programs. In: ILPS, pp. 181\u2013198 (1993)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0743-1066(97)10011-5","volume":"35","author":"C. Baral","year":"1998","unstructured":"Baral, C., Gelfond, M., Kosheleva, O.: Expanding queries to incomplete databases by interpolating general logic programs. J. Log. Program.\u00a035(3), 195\u2013230 (1998)","journal-title":"J. Log. Program."},{"key":"2_CR4","unstructured":"Brachman, R.J., Levesque, H.J.: Competence in knowledge representation. In: National Conference on Artificial Intelligence (AAAI 1982), pp. 189\u2013192 (1982)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"2_CR6","first-page":"106","volume-title":"KR","author":"M. Denecker","year":"2004","unstructured":"Denecker, M.: What\u2019s in a model? Epistemological analysis of logic programming. In: Dubois, D., Welty, C.A., Williams, M.-A. (eds.) KR, pp. 106\u2013113. AAAI Press, Menlo Park (2004)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Denecker, M., Ternovska, E.: A logic of nonmonotone inductive definitions. ACM Transactions on Computational Logic (TOCL)\u00a09(2), Article 14 (2008)","DOI":"10.1145\/1342991.1342998"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The second Answer Set Programming competition. In: Erdem, E., et al. (eds.) [9], pp. 637\u2013654","DOI":"10.1007\/978-3-642-04238-6_75"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming and Nonmonotonic Reasoning","year":"2009","unstructured":"Erdem, E., Lin, F., Schaub, T. (eds.): LPNMR 2009. LNCS, vol.\u00a05753. Springer, Heidelberg (2009)"},{"key":"2_CR10","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Veloso, M.M. (ed.) IJCAI, pp. 372\u2013379 (2007)"},{"key":"2_CR11","unstructured":"Gelfond, M.: Strong introspection. In: AAAI, pp. 386\u2013391 (1991)"},{"key":"2_CR12","first-page":"1070","volume-title":"ICLP\/SLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) ICLP\/SLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"issue":"3\/4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Computing"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Przymusinska, H.: Reasoning on open domains. In: LPNMR, pp. 397\u2013413 (1993)","DOI":"10.7551\/mitpress\/4307.003.0033"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Open answer set programming with guarded programs. ACM Trans. Comput. Log.\u00a09(4) (2008)","DOI":"10.1145\/1380572.1380575"},{"key":"2_CR16","unstructured":"Kowalski, R.A.: Predicate logic as programming language. In: IFIP Congress, pp. 569\u2013574 (1974)"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-89982-2_8","volume-title":"Logic Programming","author":"V. Lifschitz","year":"2008","unstructured":"Lifschitz, V.: Twelve definitions of a stable model. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 37\u201351. Springer, Heidelberg (2008)"},{"key":"2_CR19","first-page":"454","volume-title":"KR","author":"F. Lin","year":"2008","unstructured":"Lin, F., Wang, Y.: Answer set programming with functions. In: Brewka, G., Lang, J. (eds.) KR, pp. 454\u2013465. AAAI Press, Menlo Park (2008)"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"V.W. Marek","year":"1991","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Autoepistemic logic. Journal of the ACM\u00a038(3), 588\u2013619 (1991)","journal-title":"Journal of the ACM"},{"key":"2_CR21","unstructured":"McCarthy, J.: Programs with common sense. In: Teddington Conference on the Mechanization of Thought Processes (1958)"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence\u00a028(1), 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"key":"2_CR23","first-page":"463","volume-title":"Machine Intelligence","author":"J. McCarthy","year":"1969","unstructured":"McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a04, pp. 463\u2013502. Edinburgh University Press, Edinburgh (1969)"},{"key":"#cr-split#-2_CR24.1","unstructured":"Moore, R.C.: Possible-world semantics for autoepistemic logic. In: Proceedings of the Workshop on Non-Monotonic Reasoning, pp. 344-354 (1984)"},{"key":"#cr-split#-2_CR24.2","unstructured":"reprinted in: Ginsberg, M. (ed.) Readings on Nonmonotonic Reasoning, pp. 137-142. Morgan Kaufmann, San Francisco (1990)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-13486-9_13","volume-title":"The Semantic Web: Research and Applications","author":"J. P\u00fchrer","year":"2010","unstructured":"P\u00fchrer, J., Heymans, S., Eiter, T.: Dealing with inconsistency when combining ontologies and rules using dl-programs. In: Aroyo, L., Antoniou, G., Hyv\u00f6nen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010. LNCS, vol.\u00a06088, pp. 183\u2013197. Springer, Heidelberg (2010)"},{"key":"2_CR26","first-page":"55","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1977","unstructured":"Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 55\u201376. Plenum Press, New York (1977)"},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/322186.322189","volume":"27","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: Equality and domain closure in first-order databases. Journal of the ACM\u00a027(2), 235\u2013249 (1980)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artif. Intell.\u00a013(1-2), 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"A. Van Gelder","year":"1993","unstructured":"Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences\u00a047(1), 185\u2013221 (1993)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20832-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T11:41:29Z","timestamp":1712403689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20832-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208317","9783642208324"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20832-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}