The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments

Details The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments

2009-06-05

arxiv.org/abs/0906.1182v1

Computer Science

Artificial Intelligence

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523003