Computing Publications

Publications Home » The CIFF proof procedure for abdu...

The CIFF proof procedure for abductive logic programming with constraints

Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Giacomo Terreni, Francesca Toni

Conference or Workshop Paper
9th European conference on logics in artificial intelligence (JELIA 04), Lisbon, Portugal
September, 2004
pp.31–43
Springer Verlag
ISBN 3-5402-3242-7
Abstract

We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly. An implementation of our proof procedure is available and has been applied successfully in the context of multiagent systems.

PDF of full publication (196 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.