The ciff proof procedure for abductive logic programming with constraints: Theory, implementation and experiments

  • Authors:

  • Paolo Mancarella;Giacomo Terreni;Fariba Sadri;Francesca Toni;Ulle Endriss

  • Affiliations:

  • Dipartimento di informatica, università di pisa, pisa, tuscany, italy (e-mail: paolo.mancarella@unipi.it, terreni@di.unipi.it);Dipartimento di informatica, università di pisa, pisa, tuscany, italy (e-mail: paolo.mancarella@unipi.it, terreni@di.unipi.it);Department of computing, imperial college london, london, uk (e-mail: fs@doc.ic.ac.uk, ft@doc.ic.ac.uk);Department of computing, imperial college london, london, uk (e-mail: fs@doc.ic.ac.uk, ft@doc.ic.ac.uk);Institute for logic, language and computation (illc), university of amsterdam, amsterdam, the netherlands (e-mail: ulle.endriss@uva.nl)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.