The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments
Artificial Intelligence
2009-06-08 v1 Logic in Computer Science
Abstract
We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Finally, we describe the CIFF system, comparing it with state of the art abductive systems and answer set solvers and showing how to use it to program some applications. (To appear in Theory and Practice of Logic Programming - TPLP).
Cite
@article{arxiv.0906.1182,
title = {The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments},
author = {P. Mancarella and G. Terreni and F. Sadri and F. Toni and U. Endriss},
journal= {arXiv preprint arXiv:0906.1182},
year = {2009}
}