论文信息 - The CIFF Proof Procedure: Definition and Soundness Results

The CIFF Proof Procedure: Definition and Soundness Results

We introduce a new proof procedure for abductive logic programming and prove 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

Paolo Mancarella | Francesca Toni | Ulle Endriss | Fariba Sadri | Giacomo Terreni

[1] Paolo Mancarella,et al. The KGP Model of Agency , 2004, ECAI.

[2] Paolo Torroni,et al. An Abductive Logic Programming Architecture for Negotiating Agents , 2002, JELIA.

[3] Bashar Nuseibeh,et al. An Abductive Approach for Analysing Event-Based Requirements Specifications , 2002, ICLP.

[4] Andrea Bracciali,et al. PROSOCS: A platform for programming software agents in computational logic , 2004 .

[5] Antonis C. Kakas,et al. ACLP: Abductive Constraint Logic Programming , 2000, J. Log. Program..

[6] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.

[7] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.

[8] Murray Shanahan,et al. An abductive event calculus planner , 2000, J. Log. Program..

[9] Robert A. Kowalski,et al. The Iff Proof Procedure for Abductive Logic Programming , 1997, J. Log. Program..

[10] Ioannis Xanthakos. Semantic integration of information by abduction , 2003 .

[11] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.