Foundations of logic programming
Foundations of logic programming
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programs with classical negation
Logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Abduction from logic program: semantics and complexity
Theoretical Computer Science
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Well-founded abduction via tabled dual programs
Proceedings of the 1999 international conference on Logic programming
Computing extended abduction through transaction programs
Annals of Mathematics and Artificial Intelligence
Abduction over 3-Valued Extended Logic Programs
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
ACLP: Flexible Solutions to Complex Problems
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
From Disjunctive Programs to Abduction
ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
Abductive logic programs with penalization: semantics, complexity and implementation
Theory and Practice of Logic Programming
Verifiable agent interaction in abductive logic programming: The SCIFF framework
ACM Transactions on Computational Logic (TOCL)
Layered Models Top-Down Querying of Normal Logic Programs
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
Constraint Handling Rules
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Evolution prospection in decision making
Intelligent Decision Technologies
Theory and Practice of Logic Programming
The role of abduction in declarative authorization policies
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Inspecting side-effects of abduction in logic programs
Logic programming, knowledge representation, and nonmonotonic reasoning
The SCIFF abductive proof-procedure
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Preference revision via declarative debugging
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Specification and verification of agent interaction using abductive reasoning
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Moral reasoning under uncertainty
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Goal-directed execution of answer set programs
Proceedings of the 14th symposium on Principles and practice of declarative programming
Hi-index | 0.00 |
Abductive logic programming offers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming offers a computational mechanism that provides a level of declarativity superior to that of Prolog, and which has supported successful applications in fields such as parsing, program analysis, and model checking. In this paper we show how to use tabled logic programming to evaluate queries to abductive frameworks with integrity constraints when these frameworks contain both default and explicit negation. The result is the ability to compute abduction over well-founded semantics with explicit negation and answer sets. Our approach consists of a transformation and an evaluation method. The transformation adjoins to each objective literal $O$ in a program, an objective literal $\hbox{\it not}(O)$ along with rules that ensure that $\hbox{\it not}(O)$ will be true if and only if $O$ is false. We call the resulting program a dual program. The evaluation method, ABDUAL, then operates on the dual program. ABDUAL is sound and complete for evaluating queries to abductive frameworks whose entailment method is based on either the well-founded semantics with explicit negation, or on answer sets. Further, ABDUAL is asymptotically as efficient as any known method for either class of problems. In addition, when abduction is not desired, ABDUAL operating on a dual program provides a novel tabling method for evaluating queries to ground extended programs whose complexity and termination properties are similar to those of the best tabling methods for the well-founded semantics. A publicly available meta-interpreter has been developed for ABDUAL using the XSB system.