A resolution principle for constrained logics
Artificial Intelligence
Abduction in Logic Programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Adaptive Constraint Handling with CHR in Java
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Compiling Constraint Handling Rules into Prolog with Attributed Variables
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Specification and verification of agent interaction protocols in a logic-based system
Proceedings of the 2004 ACM symposium on Applied computing
An abductive framework for a-priori verification of web services
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Verifiable agent interaction in abductive logic programming: The SCIFF framework
ACM Transactions on Computational Logic (TOCL)
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A-system: problem solving through abduction
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
HYPROLOG: a new logic programming language with assumptions and abduction
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Sicstus prolog-the first 25 years
Theory and Practice of Logic Programming - Prolog Systems
Theory and Practice of Logic Programming - Prolog Systems
Deon+: abduction and constraints for normative reasoning
Logic Programs, Norms and Action
Executing Suspended Logic Programs
Fundamenta Informaticae
A Computational Logic Application Framework for Service Discovery and Contracting
International Journal of Web Services Research
| Hi-index | 0.00 |
Abduction is a form of inference that supports hypothetical reasoning and has been applied to a number of domains, such as diagnosis, planning, protocol verification. Abductive Logic Programming ALP is the integration of abduction in logic programming. Usually, the operational semantics of an ALP language is defined as a proof procedure. The first implementations of ALP proof-procedures were based on the meta-interpretation technique, which is flexible but limits the use of the built-in predicates of logic programming systems. Another, more recent, approach exploits theoretical results on the similarity between abducibles and constraints. With this approach, which bears the advantage of an easy integration with built-in predicates and constraints, Constraint Handling Rules has been the language of choice for the implementation of abductive proof procedures. The first CHR-based implementation mapped integrity constraints directly to CHR rules, which is an efficient solution, but prevents defined predicates from being in the body of integrity constraints and does not allow a sound treatment of negation by default. In this paper, we describe the CHR-based implementation of the SCIFF abductive proof-procedure, which follows a different approach. The SCIFF implementation maps integrity constraints to CHR constraints, and the transitions of the proof-procedure to CHR rules, making it possible to treat default negation, while retaining the other advantages of CHR-based implementations of ALP proof-procedures.