Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Minimal and consistent evolution of knowledge bases

Minimal and consistent evolution of knowledge bases This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses a preference for data explicity stored in the database over the data deduced by default. This requirement seems rational for many applications and yet it is hard to be expressed with a set of integrity constraints. We handle safe negation and local variables in the bodies of the rules. We tackle the issue of modifying the active domain (i.e. adding new constants or removing some of the constants which are present in the knowledge base), and we demonstrate how interaction with the user can be used to handle recursive definitions. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied Non-Classical Logics Taylor & Francis

Minimal and consistent evolution of knowledge bases

Download PDF
30 pages

Minimal and consistent evolution of knowledge bases

Abstract

This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses a preference for data explicity stored in the database over the data deduced by default. This requirement seems rational for many applications and yet...
Loading next page...
 
/lp/taylor-francis/minimal-and-consistent-evolution-of-knowledge-bases-NZXhwdtoOg
Publisher
Taylor & Francis
Copyright
Copyright Taylor & Francis Group, LLC
ISSN
1958-5780
eISSN
1166-3081
DOI
10.1080/11663081.1997.10510902
Publisher site
See Article on Publisher Site

Abstract

This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses a preference for data explicity stored in the database over the data deduced by default. This requirement seems rational for many applications and yet it is hard to be expressed with a set of integrity constraints. We handle safe negation and local variables in the bodies of the rules. We tackle the issue of modifying the active domain (i.e. adding new constants or removing some of the constants which are present in the knowledge base), and we demonstrate how interaction with the user can be used to handle recursive definitions.

Journal

Journal of Applied Non-Classical Logics – Taylor & Francis

Published: Jan 1, 1997

Keywords: knowledge base updates; deductive databases; view updates; consistency maintenance

There are no references for this article.