TY  - RPRT
T1  - On abduction and answer generation through constrained resolution  
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1992
A1  - Bürckert,Hans-Jürgen
A1  - Nutt,Werner
Y1  - 2011/06/25
N2  - 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. 
KW  - Künstliche Intelligenz
KW  - Constraint <Künstliche Intelligenz>
KW  - Programmierlogik
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3643
ER  -