• Corpus ID: 23538849

Exception-Based Knowledge Updates

  title={Exception-Based Knowledge Updates},
  author={Martin Slota and Jo{\~a}o Leite},
Existing methods for dealing with knowledge updates differ greatly depending on the underlying knowledge representation formalism. When Classical Logic is used, updates are typically performed by manipulating the knowledge base on the model-theoretic level. On the opposite side of the spectrum stand the semantics for updating Answer-Set Programs that need to rely on rule syntax. Yet, a unifying perspective that could embrace both these branches of research is of great importance as it enables a… 

Figures and Tables from this paper

Model Reconciliation in Logic Programs
It is proved that, for a reasonable selected set of rules, there exists a way to modify πh such that π̂h is guaranteed to credulously entail q (or skeptically entail ¬q).


Robust Equivalence Models for Semantic Updates of Answer-Set Programs
A novel monotonic characterisation of rules is introduced, dubbed RE- models, and it is shown to be a more suitable semantic foundation for rule updates than SE-models, and a generic framework for defining semantic rule update operators is proposed.
A Unifying Perspective on Knowledge Updates
It is shown that the framework can also capture a wide range of both model- and formula-based belief update operators which constitute the formal underpinning of existing approaches to ontology updates, opening new possibilities for addressing updates of hybrid knowledge bases consisting of both an ontology and a rule component.
The rise and fall of semantic rule updates based on SE-models*
A representation theorem is proved which makes it possible to constructively define any operator satisfying a set of postulates derived from Katsuno and Mendelzon's postulates for belief update, and a serious drawback of all rule update operators is uncovered.
Splitting and updating hybrid knowledge bases
An update operator for a large class of hybrid knowledge bases where both the DL component as well as the rule component are allowed to dynamically change is introduced.
On properties of update sequences based on causal rejection
The current approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics is shown to be semantically equivalent to inheritance programs, which have been independently defined by Buccafurri et al., and to certain classes of dynamic logic programs.
Towards closed world reasoning in dynamic open worlds
This paper focuses on knowledge updates and extends the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties.
An Evolvable Rule-Based E-mail Agent
The case is made by exhibiting a detailed application example of how EVOLP can be used to express updateable RuleML rule bases, employing it to define an evolving e-mail Personal Assistant Agent.
On the Approximation of Instance Level Update and Erasure in Description Logics
This work addresses the problem of how to deal with changes to a Description Logic knowledge base, when these changes affect only its ABox, and introduces the notion of best approximation of an update (erasure) in a DL L, with the goal of characterizing the L ABoxes that capture the update at best.
Dynamic updates of non-monotonic knowledge bases
On the Update of Description Logic Ontologies at the Instance Level
This work provides a general semantics for instance level update in Description Logics, and shows that DL-Lite is closed with respect to instancelevel update, in the sense that the result of an update is always expressible as a new DL- lite ABox.