Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logical language for data and knowledge bases
A logical language for data and knowledge bases
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science
Proceedings of the eleventh international conference on Logic programming
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
Bottom-up evaluation and query optimization of well-founded models
Theoretical Computer Science
Cost-based optimization for magic: algebra and implementation
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Proceedings of the 1999 international conference on Logic programming
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Reasoning with Infinite Stable Models II: Disjunctive Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
The Magic of Duplicates and Aggregates
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Soft stratification for magic set based query evaluation in deductive databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Reasoning with infinite stable models
Artificial Intelligence
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Termination analysis of logic programs through combination of type-based norms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Magic Sets and their application to data integration
Journal of Computer and System Sciences
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
Journal of Automated Reasoning
Partial Functions and Equality in Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Composing Normal Programs with Function Symbols
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
On finitely recursive programs1
Theory and Practice of Logic Programming
One More Decidable Class of Finitely Ground Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
The First Version of a New ASP Solver: ASPeRiX
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Bidirectional answer set programs with function symbols
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
FDNC: decidable non-monotonic disjunctive logic programs with function symbols
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
Disjunctive asp with functions: Decidable queries and effective computation*
Theory and Practice of Logic Programming
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
Unfounded sets and well-founded semantics of answer set programs with aggregates
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The support for function symbols in logic programming under answer set semantics allows us to overcome some modeling limitations of traditional Answer Set Programming (ASP) systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Recently, the research community has been focusing on finding proper subclasses of programs with functions for which decidability of inference is guaranteed. The two major proposals, so far, are finitary programs and finitely-ground programs. These two proposals are somehow complementary: indeed, the former is conceived to allow decidable querying (by means of a top-down evaluation strategy), while the latter supports the computability of answer sets (by means of a bottom-up evaluation strategy). One of the main advantages of finitely-ground programs is that they can be “directly” evaluated by current ASP systems, which are based on a bottom-up computational model. However, there are also some interesting programs which are suitable for top-down query evaluation; but they do not fall in the class of finitely-ground programs. In this paper, we focus on disjunctive finitely recursive positive (DFRP) programs. We design a version of the magic sets technique for DFRP programs, which ensures query equivalence under both brave and cautious reasoning. We show that, if the input program is DFRP, then its magic-sets rewriting is guaranteed to be finitely ground. Reasoning on DFRP programs turns out to be decidable; and we provide also an effective method that allows one to simply perform this reasoning by using the ASP system DLV.