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.
Cite
CITATION STYLE
Endriss, U., Mancarella, P., Sadri, F., Terreni, G., & Toni, F. (2004). The CIFF proof procedure for abductive logic programming with constraints. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3229, pp. 31–43). Springer Verlag. https://doi.org/10.1007/978-3-540-30227-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
