{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:38:27Z","timestamp":1725543507151},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540366355"},{"type":"electronic","value":"9783540366362"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_19","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"242-256","source":"Crossref","is-referenced-by-count":2,"title":["Predicate Introduction Under Stable and Well-Founded Semantics"],"prefix":"10.1007","author":[{"given":"Johan","family":"Wittocx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost","family":"Vennekens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"Mari\u00ebn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4-5","key":"19_CR1","first-page":"425","volume":"3","author":"M. Balduccini","year":"2003","unstructured":"Balduccini, M., Gelfond, M.: Diagnostic reasoning with A-Prolog. TPLP\u00a03(4-5), 425\u2013461 (2003)","journal-title":"TPLP"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/3-540-44957-4_47","volume-title":"Computational Logic - CL 2000","author":"M. Denecker","year":"2000","unstructured":"Denecker, M.: Extending Classical Logic with Inductive Definitions. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J., et al. (eds.) CL 2000. LNCS, vol.\u00a01861, p. 703. Springer, Heidelberg (2000)"},{"key":"19_CR3","doi-asserted-by":"crossref","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., Truszczy\u0144ski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, ch.\u00a06, pp. 127\u2013144. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"19_CR4","first-page":"74","volume-title":"Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000)","author":"M. Denecker","year":"2000","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Uniform semantic treatment of default and autoepistemic logics. In: Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), Breckenridge, April 11-15, pp. 74\u201384. Morgan Kaufmann, San Francisco (2000)"},{"issue":"1","key":"19_CR5","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., Truszczy\u0144ski, M.: Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence\u00a0143(1), 79\u2013122 (2003)","journal-title":"Artificial Intelligence"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-24609-1_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2003","unstructured":"Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions and its modularity properties. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol.\u00a02923, pp. 47\u201360. Springer, Heidelberg (2003)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"22","author":"J. Dix","year":"1995","unstructured":"Dix, J.: A classification theory of semantics of normal logic programs: II. weak properties. Fundam. Inform.\u00a022(3), 257\u2013288 (1995)","journal-title":"Fundam. Inform."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/3-540-58495-1_51","volume-title":"Methodologies for Intelligent Systems","author":"J. Dix","year":"1994","unstructured":"Dix, J., M\u00fcller, M.: Partial evaluation and relevance for approximations of stable semantics. In: Ra\u015b, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol.\u00a0869, pp. 511\u2013520. Springer, Heidelberg (1994)"},{"key":"19_CR9","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, 25\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"key":"19_CR10","first-page":"1070","volume-title":"International Joint Conference and Symposium on Logic Programming (JICSLP 1988)","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: International Joint Conference and Symposium on Logic Programming (JICSLP 1988), pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1142\/S0218194096000053","volume":"6","author":"M. Gelfond","year":"1996","unstructured":"Gelfond, M., Przymusinska, H.: Towards a theory of elaboration tolerance: Logic programming approach. Journal on Software and Knowledge Engineering\u00a06(1), 89\u2013112 (1996)","journal-title":"Journal on Software and Knowledge Engineering"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W., Topor, R.W.: Making Prolog more expressive. Journal of Logic Programming\u00a01(3), 225\u2013240 (1984)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"19_CR13","first-page":"588","volume":"38","author":"V. Wiktor Marek","year":"1991","unstructured":"Wiktor Marek, V., Truszczy\u0144ski, M.: Autoepistemic logic. J. ACM\u00a038(3), 588\u2013619 (1991)","journal-title":"J. ACM"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-27775-0_5","volume-title":"Logic Programming","author":"T. Schrijvers","year":"2004","unstructured":"Schrijvers, T., Serebrenik, A.: Improving Prolog Programs: Refactoring for Prolog. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 58\u201372. Springer, Heidelberg (2004)"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"A. Gelder Van","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":"19_CR16","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","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"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Vennekens, J., Gilis, D., Denecker, M.: Splitting an operator: Algebraic modularity results for logics with fixpoint semantics. ACM Transactions on computational logic (TOCL) (to appear, 2006)","DOI":"10.1145\/1166109.1166115"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:12Z","timestamp":1605625872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11799573_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}