The CIFF Proof Procedure for Abductive Logic Programming

Since 2006, CIFF is maintained by Giacomo Terreni; see his website for the latest developments.

This page provides access to an implementation of the CIFF proof procedure for abductive logic programming with constraints, which is both an extension and a refinement of the IFF proof procedure proposed by Fung and Kowalski.

Previous versions of CIFF are also available. Note that, because of the specific constraint solver used, the program will only run under Sicstus Prolog. A number of example files are available here.

Related papers:

This research has been supported by the European Union as part of the SOCS project (IST-2001-32530). In case of problems, questions, or suggestions, please contact Ulle Endriss (