The CIFF Proof Procedure for Abductive Logic Programming with Constraints

13 years 9 months ago

Download www.doc.ic.ac.uk

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.

Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi

Real-time Traffic

Abductive Logic Programming | Abductive Reasoning | Artificial Intelligence | JELIA 2004 | Proof Procedure |

claim paper

» Web Sites Verification An Abductive Logic Programming Tool

» Programming Applications in CIFF

» From Logic Programming Towards MultiAgent Systems

» Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents

» Interpreting Abduction in CLP

» A System for Abductive Learning of Logic Programs

» Inductive Logic Programming as Abductive Search

» Hypothetical Updates Priority and Inconsistency in a Logic Programming Language

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	JELIA
Authors	Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Giacomo Terreni, Francesca Toni

Comments (0)

Sciweavers

The CIFF Proof Procedure for Abductive Logic Programming with Constraints

Abductive Logic Programming | Abductive Reasoning | Artificial Intelligence | JELIA 2004 | Proof Procedure |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers