The CIFF Proof Procedure for Abductive Logic Programming with Constraints

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.

• Type: Conference
• Year: 2004
• Where: JELIA
• Authors: Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Giacomo Terreni, Francesca Toni
• Keywords: Abductive Logic Programming, Abductive Reasoning, Artificial Intelligence, JELIA 2004, Proof Procedure