Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-28T04:04:41.559Z Has data issue: false hasContentIssue false
  • English
  • Français

An abductive framework for computing knowledge base updates

Published online by Cambridge University Press:  25 November 2003

CHIAKI SAKAMA  and
KATSUMI INOUE
CHIAKI SAKAMA
Affiliation:
Department of Computer and Communication Sciences, Wakayama University, Wakayama 640 8510, Japan (e-mail: sakama@sys.wakayama-u.ac.jp)
KATSUMI INOUE
Affiliation:
Department of Electrical and Electronics Engineering, Kobe University, Kobe 657 8501, Japan (e-mail: inoue@eedept.kobe-u.ac.jp)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper introduces an abductive framework for updating knowledge bases represented by extended disjunctive programs. We first provide a simple transformation from abductive programs to update programs which are logic programs specifying changes on abductive hypotheses. Then, extended abduction, which was introduced by the same authors as a generalization of traditional abduction, is computed by the answer sets of update programs. Next, different types of updates, view updates and theory updates are characterized by abductive programs and computed by update programs. The task of consistency restoration is also realized as special cases of these updates. Each update problem is comparatively assessed from the computational complexity viewpoint. The result of this paper provides a uniform framework for different types of knowledge base updates, and each update is computed using existing procedures of logic programming.

Keywords

extended disjunctive programextended abductionview updatetheory updateconsistency restoration
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 3 , Issue 6 , November 2003 , pp. 671 - 715
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This paper is a revised and extended version of (Sakama and Inoue, 1999).