{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:31Z","timestamp":1725747211908},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397172"},{"type":"electronic","value":"9783642397189"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39718-9_21","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T03:01:54Z","timestamp":1377831714000},"page":"355-372","source":"Crossref","is-referenced-by-count":0,"title":["Embedding Functions into Disjunctive Logic Programs"],"prefix":"10.1007","author":[{"given":"Yisong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Bartholomew, M., Lee, J.: Stable models of formulas with intensional functions. In: KR 2012, Rome, Italy, pp. 2\u201312. AAAI Press (2012)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-74610-2_7","volume-title":"Logic Programming","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. LNCS, vol.\u00a04670, pp. 89\u2013103. Springer, Heidelberg (2007)"},{"issue":"12","key":"21_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Communications of the ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"21_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-87803-2_8","volume-title":"Logics in Artificial Intelligence","author":"A. Bria","year":"2008","unstructured":"Bria, A., Faber, W., Leone, N.: Normal Form Nested Programs. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol.\u00a05293, pp. 76\u201388. Springer, Heidelberg (2008)"},{"key":"21_CR5","unstructured":"Cabalar, P.: A functional action language front-end. In: ASPOCP 2005 (July 2005), \n                  \n                    http:\/\/www.dc.fi.udc.es\/~cabalar\/asp05_C.pdf"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-89982-2_37","volume-title":"Logic Programming","author":"F. Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable Functions in ASP: Theory and Implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"key":"21_CR7","unstructured":"Chen, Y., Lin, F., Wang, Y., Zhang, M.: First-order loop formulas for normal logic programs. In: KR 2006, UK, pp. 298\u2013307. AAAI Press (2006)"},{"issue":"4-5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03(4-5), 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-24599-5_34","volume-title":"Logic Programming","author":"S.T. Erdo\u011fan","year":"2003","unstructured":"Erdo\u011fan, S.T., Lifschitz, V.: Definitions in answer set programming. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 483\u2013484. Springer, Heidelberg (2003)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P. Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artificial Intelligence\u00a0175(1), 236\u2013263 (2011)","journal-title":"Artificial Intelligence"},{"key":"21_CR11","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP 1988, Seattle, Washington, pp. 1070\u20131080. MIT Press (1988)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning\u00a036(4), 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"21_CR13","unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: IJCAI 2005, Edinburgh, Scotland, UK, pp. 503\u2013508. Professional Book Center (2005)"},{"key":"21_CR14","first-page":"125","volume":"42","author":"J. Lee","year":"2011","unstructured":"Lee, J., Meng, Y.: First-order stable model semantics and first-order loop formulas. J. Artif. Intell. Res. (JAIR)\u00a042, 125\u2013180 (2011)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-24599-5_31","volume-title":"Logic Programming","author":"J. Lee","year":"2003","unstructured":"Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 451\u2013465. Springer, Heidelberg (2003)"},{"issue":"3","key":"21_CR16","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":"21_CR17","unstructured":"Lifschitz, V.: Foundations of logic programming. In: Principles of Knowledge Representation, pp. 69\u2013127. CSLI Publications (1996)"},{"key":"21_CR18","unstructured":"Lifschitz, V.: Logic programs with intensional functions. In: KR 2012, Rome, Italy, pp. 24\u201331. AAAI Press (2012)"},{"issue":"4","key":"21_CR19","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 Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz, V., Razborov, A.A.: Why are there so many loop formulas? ACM Transactions on Computational Logic\u00a07(2), 261\u2013268 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3-4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"21_CR22","unstructured":"Lin, F., Wang, Y.: Answer set programming with functions. In: KR 2008, Sydney, Australia, pp. 454\u2013464. AAAI Press (2008)"},{"issue":"1-2","key":"21_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"21_CR24","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"27","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczynski, M.: Properties and applications of programs with monotone and convex constraints. JAIR\u00a027, 299\u2013334 (2006)","journal-title":"JAIR"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: A 25-Year Perspective","author":"V. Wiktor Marek","year":"1999","unstructured":"Wiktor Marek, V., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375\u2013398. Springer, Berlin (1999)"},{"issue":"3-4","key":"21_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"21_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-30227-8_15","volume-title":"Logics in Artificial Intelligence","author":"D. Pearce","year":"2004","unstructured":"Pearce, D., Valverde, A.: Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 147\u2013160. Springer, Heidelberg (2004)"},{"key":"21_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-540-75560-9_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. \u0160imkus","year":"2007","unstructured":"\u0160imkus, M., Eiter, T.: \n                  \n                    \n                  \n                  $\\mathbb{FDNC}$\n                : Decidable non-monotonic disjunctive logic programs with function symbols. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 514\u2013530. Springer, Heidelberg (2007)"},{"issue":"3-4","key":"21_CR29","first-page":"341","volume":"60","author":"Y. Wang","year":"2010","unstructured":"Wang, Y., You, J.-H., Lin, F., Yuan, L.-Y., Zhang, M.: Weight constraint programs with evaluable functions. AMAI\u00a060(3-4), 341\u2013380 (2010)","journal-title":"AMAI"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/978-3-642-24728-6_91","volume-title":"Advanced Intelligent Computing","author":"B. Yang","year":"2011","unstructured":"Yang, B., Zhang, M., Zhang, Y.: Applying answer set programming to points-to analysis of object-oriented language. In: Huang, D.-S., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds.) ICIC 2011. LNCS, vol.\u00a06838, pp. 676\u2013685. Springer, Heidelberg (2011)"},{"key":"21_CR31","unstructured":"You, J.-H., Yuan, L.-Y., Mingyi, Z.: On the equivalence between answer sets and models of completion for nested logic programs. In: IJCAI 2003, Acapulco, Mexico, pp. 859\u2013866. Morgan Kaufmann (2003)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39718-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:22:22Z","timestamp":1558052542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39718-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397172","9783642397189"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39718-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}