Refinements of the CIFF Procedure

Abstract

Abductive Logic Programming (ALP) combines abductive reasoning with logic programming. In recent work [2], we have introduced a new proof procedure for ALP which we call CIFF. Our procedure extends the IFF procedure of Fung and Kowalski [3] by integrating ALP with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure… (More)

Topics

  • Presentations referencing similar topics