The CIFF proof procedure: definition and soundness results
File(s)DTR04-2.pdf (193.83 KB)
Published version
Author(s)
Endriss, U
Mancarella, P
Sadri, Fariba
Terreni, G
Toni, F
Type
Report
Abstract
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
multiagent systems.
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
multiagent systems.
Date Issued
2004-01-01
Citation
Departmental Technical Report: 04/2, 2004, pp.1-17
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
17
Journal / Book Title
Departmental Technical Report: 04/2
Copyright Statement
© 2004 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Publication Status
Published
Article Number
04/2