{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T05:23:09Z","timestamp":1750483389096,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755586"},{"type":"electronic","value":"9783540755609"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75560-9_37","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T01:36:46Z","timestamp":1191634606000},"page":"514-530","source":"Crossref","is-referenced-by-count":15,"title":["$\\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols"],"prefix":"10.1007","author":[{"given":"Mantas","family":"\u0160imkus","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-540-74610-2_7","volume-title":"ICLP 2007","author":"S. Baselice","year":"2007","unstructured":"Baselice, S., Bonatti, P.A., Criscuolo, G.: On Finitely Recursive Programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007, September 8-13. LNCS, vol.\u00a04670, pp. 89\u2013103. Springer, Heidelberg (2007) \n                  \n                    http:\/\/dx.doi.org\/10.1007\/978-3-540-74610-2_7"},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2004.02.001","volume":"156","author":"P.A. Bonatti","year":"2004","unstructured":"Bonatti, P.A.: Reasoning with infinite stable models. Artif. Intell.\u00a0156(1), 75\u2013111 (2004)","journal-title":"Artif. Intell."},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/976706.976708","volume":"5","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. ACM Transactions on Computational Logic\u00a05(2), 206\u2013263 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3\/4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence\u00a015(3\/4), 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"37_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0743-1066(97)00027-7","volume":"33","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G.: Expressiveness of stable model semantics for disjuncitve logic programs with functions. J. Log. Program.\u00a033(2), 167\u2013178 (1997)","journal-title":"J. Log. Program."},{"issue":"3\/4","key":"37_CR6","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 Comput.\u00a09(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Comput."},{"key":"37_CR7","unstructured":"Giunchiglia, E., Lifschitz, V.: An Action Language Based on Causal Explanation: Preliminary Report. In: AAAI 1998. Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 623\u2013630 (1998)"},{"key":"37_CR8","unstructured":"Heymans, S.: Decidable Open Answer Set Programming. PhD thesis, Theoretical Computer Science Lab (TINF), Department of Computer Science, Vrije Universiteit Brussel, Pleinlaan 2, B1050 Brussel, Belgium (February 2006)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/11431053_27","volume-title":"The Semantic Web: Research and Applications","author":"S. Heymans","year":"2005","unstructured":"Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. In: G\u00f3mez-P\u00e9rez, A., Euzenat, J. (eds.) ESWC 2005. LNCS, vol.\u00a03532, pp. 392\u2013407. Springer, Heidelberg (2005)"},{"issue":"3","key":"37_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Remmel, J.B.: On the expressibility of stable logic programming. In: LPNMR, pp. 107\u2013120 (2001)","DOI":"10.1007\/3-540-45402-0_8"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0168-0072(92)90069-C","volume":"56","author":"W. Marek","year":"1992","unstructured":"Marek, W., Nerode, A., Remmel, J.: How Complicated is the Set of Stable Models of a Recursive Logic Program? Annals of Pure and Applied Logic\u00a056, 119\u2013135 (1992)","journal-title":"Annals of Pure and Applied Logic"},{"key":"37_CR13","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J. Minker","year":"1988","unstructured":"Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Francisco (1988)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Motik, B., Horrocks, I., Sattler, U.: Bridging the Gap Between OWL and Relational Databases. In: Proc. of WWW\u00a02007, pp. 807\u2013816 (2007)","DOI":"10.1145\/1242572.1242681"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"37_CR16","unstructured":"Woltran, S.: Answer Set Programming: Model Applications and Proofs-of-Concept. Technical Report WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004) (July 2005), available at \n                  \n                    http:\/\/www.kr.tuwien.ac.at\/projects\/WASP\/report.html"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75560-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:36:48Z","timestamp":1558262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75560-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755586","9783540755609"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75560-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}