Output details
11 - Computer Science and Informatics
University of Huddersfield
Disjunctive ASP with functions: Decidable queries and effective computation
<22> This article resolved a research question that was open for about a decade, namely whether finitely recursive queries over stratified disjunctive datalog programs are decidable. The answer is positive and relies on linking finitely recursive queries to finitely ground programs (which are known to be decidable) by means of a magic set transformation. This link is constructive and therefore also allows for an immediate implementation for finitely recursive queries. This is unusual, as almost all related work is purely theoretical. Finally, it is also shown that any computable function can be expressed in this formalism.