{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:30:58Z","timestamp":1762101058447},"reference-count":23,"publisher":"Cambridge University Press (CUP)","issue":"4-6","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"unspecified","delay-in-days":8,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Querying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASP<jats:sup>fs<\/jats:sup>). We show that query answering in this setting is decidable, if the query is finitely recursive (ASP<jats:sup>fs<\/jats:sup><jats:sub>fr<\/jats:sub>). Our proof yields also an effective method for query evaluation. It is done by extending the magic set technique to ASP<jats:sup>fs<\/jats:sup><jats:sub>fr<\/jats:sub>. We show that the magic-set rewritten program is query equivalent to the original one (under both brave and cautious reasoning). Moreover, we prove that the rewritten program is also finitely ground, implying that it is decidable. Importantly, finitely ground programs are evaluable using existing ASP solvers, making the class of ASP<jats:sup>fs<\/jats:sup><jats:sub>fr<\/jats:sub> queries usable in practice.<\/jats:p>","DOI":"10.1017\/s1471068410000244","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T08:44:40Z","timestamp":1278665080000},"page":"497-512","source":"Crossref","is-referenced-by-count":19,"title":["Disjunctive ASP with functions: Decidable queries and effective computation"],"prefix":"10.1017","volume":"10","author":[{"given":"MARIO","family":"ALVIANO","sequence":"first","affiliation":[]},{"given":"WOLFGANG","family":"FABER","sequence":"additional","affiliation":[]},{"given":"NICOLA","family":"LEONE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"key":"S1471068410000244_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1185840"},{"key":"S1471068410000244_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068410000244_ref18","first-page":"489","volume-title":"Proceedings of the 25th International Conference on Logic Programming (ICLP 2009)","author":"Lierler","year":"2009"},{"key":"S1471068410000244_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_24"},{"key":"S1471068410000244_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00153-A"},{"key":"S1471068410000244_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068410000244_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_9"},{"key":"S1471068410000244_ref1","unstructured":"Alviano M. , Faber W. , Greco G. , and Leone N. 2009. Magic Sets for Disjunctive Datalog Programs. Technical Report 09\/2009, Dipartimento di Matematica, Universit\u00e0 della Calabria, Italy. http:\/\/www.wfaber.com\/research\/papers\/TRMAT092009.pdf."},{"key":"S1471068410000244_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)90038-Q"},{"key":"S1471068410000244_ref23","volume-title":"Principles of Database and Knowledge Base Systems","author":"Ullman","year":"1989"},{"key":"S1471068410000244_ref17","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2630"},{"key":"S1471068410000244_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840900372X"},{"key":"S1471068410000244_ref10","unstructured":"Calimeri F. , Cozza S. , Ianni G. , and Leone N. 2008b. DLV-Complex homepage. http:\/\/www.mat.unical.it\/dlv-complex."},{"key":"S1471068410000244_ref5","first-page":"333","volume-title":"Proceedings of the 18th International Conference on Logic Programming (ICLP 2002)","author":"Bonatti","year":"2002"},{"key":"S1471068410000244_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.02.001"},{"key":"S1471068410000244_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1216374.1216378"},{"key":"S1471068410000244_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932293"},{"key":"S1471068410000244_ref8","first-page":"392","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","author":"Cabalar","year":"2008"},{"key":"S1471068410000244_ref9","first-page":"407","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP 2008)","author":"Calimeri","year":"2008"},{"key":"S1471068410000244_ref12","first-page":"765","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09)","author":"Eiter","year":"2009"},{"key":"S1471068410000244_ref19","first-page":"454","volume-title":"Proceedings of Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR2008)","author":"Lin","year":"2008"},{"key":"S1471068410000244_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75560-9_37"},{"key":"S1471068410000244_ref21","first-page":"267","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning","author":"Syrj\u00e4nen","year":"2001"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068410000244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:32:07Z","timestamp":1556465527000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000244\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":23,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["S1471068410000244"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000244","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}