Abstract: "We present a query evaluation method for abduction. In artificial intelligence, abduction has been recognized as important human reasoning and has been applied in various fields [3]. In logic programming, Eshgi and Kowalski [3] introduce abduction to handle negation as failure and Ka...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Satoh, Ken 1959- (VerfasserIn), Iwayama, Noboru (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Tokyo, Japan 1992
Schriftenreihe:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 756
Schlagworte:	Logic programming
Zusammenfassung:	Abstract: "We present a query evaluation method for abduction. In artificial intelligence, abduction has been recognized as important human reasoning and has been applied in various fields [3]. In logic programming, Eshgi and Kowalski [3] introduce abduction to handle negation as failure and Kakas and Mancarella [5,6] extend the framework to include any arbitrary abducible predicate. We have already proposed a correct bottom-up procedure to compute abduction. However, this procedure is not suitable for a query evaluation. Although [6] proposes a query evaluation method by extending the procedure in [3], there is a problem of incorrectness in the procedure in [3] and the problem is inherited to the procedure in [6]. Moreover, their procedures can only handle a limited class of integrity constraints Our proposed procedure in this paper is correct for any consistent abductive framework. If the procedure succeeds, there is a set of hypotheses which satisfies a query, and if the procedure finitely fails, there is no such set. We can guarantee correctness since we adopt a forward evaluation of rules and check consistency of 'implicit deletion' [8]. Thanks to the forward evaluation of rules, we can also handle any form of integrity constraints.
Beschreibung:	18 S.