Output details
11 - Computer Science and Informatics
University of Huddersfield
Return to search
Output 0 of 0 in the submission
Article title
Disjunctive ASP with functions: Decidable queries and effective computation
Type
D - Journal article
Title of journal
Theory and Practice of Logic Programming
Article number
-
Volume number
10
Issue number
4-6
First page of article
497
ISSN of journal
1471-0684
Year of publication
2010
Number of additional authors
2
Additional information
<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.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
9
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
