Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Handbook of theoretical computer science (vol. B)
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reasoning with infinite stable models
Artificial Intelligence
On finitely recursive programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
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
Fusion of Logic Programming and Description Logics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Disjunctive asp with functions: Decidable queries and effective computation*
Theory and Practice of Logic Programming
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
Current Answer Set Programming (ASP) solvers largely build on logic programming without function symbols. This limitation makes ASP decidable, but greatly complicates the modeling of indefinite time, recursive data structures (e.g., lists), and infinite processes and objects in general. Recent research thus aims at finding decidable fragments of ASP with function symbols and studying their complexity. We identify bidirectional ASP programs as an expressive such fragment that is useful, e.g., for reasoning about actions involving both the future and the past. We tightly characterize the computational complexity of bidirectional programs and of some of their subclasses, addressing the main reasoning tasks. Our results also imply that the recently introduced FDNC programs can be extended by inverse predicates while retaining decidability, but computational costs are unavoidably higher.