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

Open Access
Authors
  • P. Mancarella
  • G. Terreni
  • F. Sadri
  • F. Toni
Publication date 2009
Journal Theory and Practice of Logic Programming
Volume | Issue number 9 | 6
Pages (from-to) 691-750
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
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.
Document type Article
Published at https://doi.org/10.1017/S1471068409990093
Downloads
312952.pdf (Final published version)
Permalink to this page
Back