Skip to main content Skip to main navigation


On Abduction and Answer Generation through Constained Resolution

Hans-Jürgen Bürckert; Werner Nutt
DFKI, DFKI Research Reports (RR), Vol. 92-51, 1992.


Recently, extensions of constrained logic programming and constrained resolution for theorem proving have been introduced, that consider constraints, which are interpreted under an open world assumption. We discuss relationships between applications of these approaches for query answering in knowledge base systems on the one hand and abduction-based hypothetical reasoning on the other hand. We show both that constrained resolution can be used as an operationalization of (some limited form of) abduction and that abduction is the logical status of an answer generation process through constrained resolution, ie., it is an abductive but not a deductive form of reasoning.