{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:16:13Z","timestamp":1768436173778,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642307423","type":"print"},{"value":"9783642307430","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30743-0_13","type":"book-chapter","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T03:49:46Z","timestamp":1338608986000},"page":"178-194","source":"Crossref","is-referenced-by-count":10,"title":["Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs"],"prefix":"10.1007","author":[{"given":"Marc","family":"Denecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost","family":"Vennekens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-13_CR1.1","doi-asserted-by":"crossref","unstructured":"Belnap, N.D.: A useful four-valued logic. In: Dunn, J.M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 8-37. Reidel, Dordrecht (1977)","DOI":"10.1007\/978-94-010-1161-7_2"},{"key":"#cr-split#-13_CR1.2","unstructured":"Invited papers from the Fifth International Symposium on Multiple-Valued Logic, held at Indiana University, Bloomington, Indiana, May 13-16 (1975)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Data Bases, pp. 293\u2013322. Plenum Press (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"13_CR3","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-1-4615-1567-8_6","volume-title":"Logic-based Artificial Intelligence","author":"M. Denecker","year":"2000","unstructured":"Denecker, M., Marek, V.W., Truszczy\u0144ski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In: Logic-based Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, pp. 127\u2013144. Kluwer Academic Publishers, Boston (2000)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0004-3702(02)00293-X","volume":"143","author":"M. Denecker","year":"2003","unstructured":"Denecker, M., Marek, V.W., Truszczynski, M.: Uniform semantic treatment of default and autoepistemic logics. Artif. Intell.\u00a0143(1), 79\u2013122 (2003)","journal-title":"Artif. Intell."},{"key":"13_CR5","unstructured":"Eiter, T., Fink, M., Tompits, H., Traxler, P., Woltran, S.: Replacements in non-ground answer-set programming. In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) KR, pp. 340\u2013351. AAAI Press (2006)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.2307\/2274093","volume":"49","author":"S. Feferman","year":"1984","unstructured":"Feferman, S.: Toward useful type-free theories. Journal of Symbolic Logic\u00a049(1), 75\u2013111 (1984)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"Fitting, M.: A Kripke-Kleene semantics for logic programs. Journal of Logic Programming\u00a02(4), 295\u2013312 (1985)","journal-title":"Journal of Logic Programming"},{"issue":"1-2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M. Fitting","year":"2002","unstructured":"Fitting, M.: Fixpoint semantics for logic programming a survey. Theoretical Computer Science\u00a0278(1-2), 25\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-45632-5_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M.: Representing Knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 413\u2013451. Springer, Heidelberg (2002)"},{"key":"13_CR10","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 (1988)"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","volume":"35","author":"T. Janhunen","year":"2009","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res (JAIR)\u00a035, 813\u2013857 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"13_CR12","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Van Nostrand (1952)"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log.\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.2131","volume":"28","author":"F. Lin","year":"2007","unstructured":"Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. J. Artif. Intell. Res (JAIR)\u00a028, 431\u2013451 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"13_CR15","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Logic programs with abstract constraint atoms. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 86\u201391. AAAI Press (2004)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A New Logical Characterisation of Stable Models and Answer Sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-006-9028-z","volume":"47","author":"D. Pearce","year":"2006","unstructured":"Pearce, D.: Equilibrium logic. Ann. Math. Artif. Intell.\u00a047(1-2), 3\u201341 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"N. Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming (TPLP)\u00a07(3), 301\u2013353 (2007)","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"issue":"4","key":"13_CR19","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T.C. Przymusinski","year":"1990","unstructured":"Przymusinski, T.C.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae\u00a013(4), 445\u2013463 (1990)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"13_CR20","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":"13_CR21","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"},{"issue":"1-2","key":"13_CR22","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FUN-2007-791-209","volume":"79","author":"J. Vennekens","year":"2007","unstructured":"Vennekens, J., Mari\u00ebn, M., Wittocx, J., Denecker, M.: Predicate introduction for logics with a fixpoint semantics. Part I: Logic programming. Fundamenta Informaticae\u00a079(1-2), 187\u2013208 (2007)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Correct Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30743-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T06:42:50Z","timestamp":1743230570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30743-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307423","9783642307430"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30743-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}