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

PP-2009-38: Mancarella, Paolo and Terreni, Giacomo and Sadri, Fariba and Toni, Francesca and Endriss, Ulle (2009) The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments. [Report]

[img]
Preview
Text (Full Text)
PP-2009-38.text.pdf

Download (559kB) | Preview
[img] Text (Abstract)
PP-2009-38.abstract.txt

Download (823B)

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.

Item Type: Report
Report Nr: PP-2009-38
Series Name: Prepublication (PP) Series
Year: 2009
Uncontrolled Keywords: logic programming; abduction; constraints
Subjects: Logic
Depositing User: Ulle Endriss
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/368

Actions (login required)

View Item View Item