Journal of Logic Programming
Abductive Partial Order Planning with Dependent Fluents
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Abduction in well-founded semantics and generalized stable models via tabled dual programs
Theory and Practice of Logic Programming
Verifiable agent interaction in abductive logic programming: The SCIFF framework
ACM Transactions on Computational Logic (TOCL)
Integrating Abduction and Constraint Optimization in Constraint Handling Rules
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A-system: problem solving through abduction
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
HYPROLOG: a new logic programming language with assumptions and abduction
ICLP'05 Proceedings of the 21st international conference on Logic Programming
A 25-year perspective on logic programming
Agents, multi-agent systems and declarative programming: what, when, where, why, who, how?
A 25-year perspective on logic programming
Deon+: abduction and constraints for normative reasoning
Logic Programs, Norms and Action
The CHR-based Implementation of the SCIFF Abductive System
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP constraints. These two frameworks have been merged in works by various authors, who developed efficient abductive proof-procedures empowered with constraint satisfaction techniques. However, while almost all CLP languages provide algorithms for finding an optimal solution with respect to some objective function (and not just any solution), the issue has received little attention in ALP. In this paper we show how optimisation meta-predicates can be included in abductive proof-procedures, achieving in this way a significant improvement to research and practical applications of abductive reasoning. In the paper, we give the declarative and operational semantics of an abductive proof-procedure that encloses constraint optimization meta-predicates, and we prove soundness in the three-valued completion semantics. In the proof-procedure, the abductive logic program can invoke optimisation meta-predicates, which can invoke abductive predicates, in a recursive way.