{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:44:39Z","timestamp":1743086679141,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319215419"},{"type":"electronic","value":"9783319215426"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21542-6_20","type":"book-chapter","created":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T10:59:32Z","timestamp":1436612372000},"page":"311-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Binary Frontier-Guarded ASP with Function Symbols"],"prefix":"10.1007","author":[{"given":"Mantas","family":"\u0160imkus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,12]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","volume":"43","author":"S Abiteboul","year":"1991","unstructured":"Abiteboul, S., Vianu, V.: Datalog extensions for database queries and updates. Journal of Computer and System Sciences 43(1), 62\u2013124 (1991)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"20_CR2","first-page":"3","volume":"4","author":"H Andr\u00e9ka","year":"1978","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: The generalised completeness of Horn predicate logics as programming language. Acta Cybernetica 4(1), 3\u201310 (1978)","journal-title":"Acta Cybernetica"},{"key":"20_CR3","unstructured":"Baget, J., Garreau, F., Mugnier, M., Rocher, S.: Revisiting chase termination for existential rules and their extension to nonmonotonic negation. CoRR abs\/1405.1071 (2014)"},{"issue":"9\u201310","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"J Baget","year":"2011","unstructured":"Baget, J., Lecl\u00e8re, M., Mugnier, M., Salvat, E.: On rules with existential variables: Walking the decidability line. Artif. Intell. 175(9\u201310), 1620\u20131654 (2011)","journal-title":"Artif. Intell."},{"key":"20_CR5","unstructured":"Baget, J., Mugnier, M., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: Proc. of IJCAI 2011. IJCAI\/AAAI (2011)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1017\/S147106840900372X","volume":"9","author":"S Baselice","year":"2009","unstructured":"Baselice, S., Bonatti, P.A., Criscuolo, G.: On finitely recursive programs. Theory and Practice of Logic Programming 9(2), 213\u2013238 (2009)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2004.02.001","volume":"156","author":"PA Bonatti","year":"2004","unstructured":"Bonatti, P.A.: Reasoning with infinite stable models. Artificial Intelligence 156(1), 75\u2013111 (2004)","journal-title":"Artificial Intelligence"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-319-09870-8_7","volume-title":"Rules on the Web","author":"M Calautti","year":"2014","unstructured":"Calautti, M., Greco, S., Molinaro, C., Trubitsyna, I.: Checking termination of logic programs with function symbols through linear constraints. In: Bikakis, A., Fodor, P., Roman, D. (eds.) RuleML 2014. LNCS, vol. 8620, pp. 97\u2013111. Springer, Heidelberg (2014)"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1613\/jair.3873","volume":"48","author":"A Cal\u00ec","year":"2013","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. J. Artif. Intell. Res. (JAIR) 48, 115\u2013174 (2013)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"20_CR10","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: de la Banda, M.G., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ic.2014.04.002","volume":"237","author":"D Calvanese","year":"2014","unstructured":"Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics via alternating tree-automata. Inf. Comput. 237, 12\u201355 (2014)","journal-title":"Inf. Comput."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of mathematics and its applications, vol. 138. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"20_CR13","unstructured":"Eiter, T., \u0160imkus, M.: Bidirectional answer set programs with function symbols. In: Boutilier, C. (ed.) Proc. of IJCAI 2009, pp. 765\u2013771 (2009)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Eiter, T., \u0160imkus, M.: FDNC: decidable nonmonotonic disjunctive logic programs with function symbols. ACM Trans. Comput. Log. 11(2) (2010)","DOI":"10.1145\/1656242.1656249"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: Proc. of FOCS 1988, pp. 328\u2013337. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"issue":"3","key":"20_CR16","first-page":"395","volume":"13","author":"C Feier","year":"2013","unstructured":"Feier, C., Heymans, S.: Reasoning with forest logic programs and f-hybrid knowledge bases. TPLP 13(3), 395\u2013463 (2013)","journal-title":"TPLP"},{"issue":"3\/4","key":"20_CR17","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 9(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Computing"},{"key":"20_CR18","unstructured":"Gottlob, G., Hernich, A., Kupke, C., Lukasiewicz, T.: Stable model semantics for guarded existential rules and description logics. In: Proc. of KR 2014. AAAI Press (2014)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Rudolph, S., \u0160imkus, M.: Expressiveness of guarded existential rule languages. In: Proc. of PODS 2014, pp. 27\u201338. ACM (2014)","DOI":"10.1145\/2594538.2594556"},{"key":"20_CR20","unstructured":"Greco, S., Molinaro, C., Trubitsyna, I.: Bounded programs: a new decidable class of logic programs with function symbols. In: Proc. of IJCAI 2013. IJCAI\/AAAI (2013)"},{"key":"20_CR21","unstructured":"Hull, R., Yoshikawa, M.: Ilog: declarative creation and manipulation of object identifiers. In: Proc. of VLDB 1990. Morgan Kaufmann Publishers Inc. (1990)"},{"key":"20_CR22","unstructured":"Lutz, C.: Inverse roles make conjunctive queries hard. In: Proc. of DL 2007. CEUR Workshop Proceedings, vol. 250. CEUR-WS.org (2007)"},{"key":"20_CR23","unstructured":"Magka, D., Kr\u00f6tzsch, M., Horrocks, I.: Computing stable models for nonmonotonic existential rules. In: Proc. of IJCAI 2013, pp. 1031\u20131038. AAAI Press\/IJCAI (2013)"},{"issue":"1\u20133","key":"20_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0168-0072(92)90069-C","volume":"56","author":"VW Marek","year":"1992","unstructured":"Marek, V.W., Nerode, A., Remmel, J.B.: How complicated is the set of stable models of a recursive logic program? Ann. Pure Appl. Logic 56(1\u20133), 119\u2013135 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1&2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"DE Muller","year":"1995","unstructured":"Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of rabin, mcnaughton and safra. Theor. Comput. Sci. 141(1&2), 69\u2013107 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR26","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. 1216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"20_CR27","unstructured":"\u0160imkus, M.: Nonmonotonic Logic Programs with Function Symbols. Ph.D. thesis, Vienna University of Technology (2010)"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","first-page":"267","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T Syrj\u00e4nen","year":"2001","unstructured":"Syrj\u00e4nen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 267\u2013279. Springer, Heidelberg (2001)"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"MY Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628\u2013641. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Rule Technologies: Foundations, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21542-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:10:54Z","timestamp":1676466654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21542-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319215419","9783319215426"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21542-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"12 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}