Integrity Constraints for General-Purpose Knowledge Bases

@article{CruzFilipe2016IntegrityCF,
  title={Integrity Constraints for General-Purpose Knowledge Bases},
  author={Lu{\'i}s Cruz-Filipe and Isabel Nunes and Peter Schneider-Kamp},
  journal={ArXiv},
  year={2016},
  volume={abs/1601.04980}
}
Integrity constraints in databases have been studied extensively since the 1980s, and they are considered essential to guarantee database integrity. In recent years, several authors have studied how the same notion can be adapted to reasoning frameworks, in such a way that they achieve the purpose of guaranteeing a system's consistency, but are kept separate from the reasoning mechanisms. In this paper we focus on multi-context systems, a general-purpose framework for combining heterogeneous… 

Active integrity constraints for general-purpose knowledge bases

TLDR
This article extends the notions of active integrity constraints and grounded repairs to multi-context systems, a general-purpose framework for combining heterogeneous reasoning systems, able to model most other reasoning frameworks, as it demonstrates.

Active Integrity Constraints for Multi-context Systems

TLDR
A formalism to couple integrity constraints over general-purpose knowledge bases with actions that can be executed to restore consistency is introduced, and it is shown that it can express most relevant types of integrity constraints in this domain.

Active Integrity Constraints: From Theory to Implementation

TLDR
This paper focuses on the development of implementations of consistency maintenance algorithms that have a solid theoretical basis and can be applied to knowledge repositories.

Grounded Fixpoints and Active Integrity Constraints

TLDR
This work shows how database repairs can be modeled as fixpoints of particular operators on databases, and proposes a corresponding notion of grounded database repair that captures several natural intuitions, and in particular avoids the problems of previous alternative semantics.

11 : 2 Grounded Fixpoints and Active Integrity Constraints

TLDR
It is shown how database repairs can be modeled as fixpoints of particular operators on databases, and how the notion of grounded fixpoint induces a corresponding notion of grounding database repair that captures several natural intuitions, and in particular avoids the problems of previous alternative semantics.

References

SHOWING 1-10 OF 37 REFERENCES

Consistent query answers in inconsistent databases

TLDR
The problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints is considered and its soundness and completeness are proved.

repAIrC: A Tool for Ensuring Data Consistency

TLDR
A tool to validate an SQL database with respect to a given set of active integrity constraints, proposing possible repairs in case the database is inconsistent.

Consistency preserving updates in deductive databases

repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints

TLDR
A tool to validate an SQL database with respect to a given set of active integrity constraints, proposing possible repairs in case the database is inconsistent.

Active integrity constraints

TLDR
(conditioned) active integrity constraints are introduced, a simple and powerful form of active rules with declarative semantics well suited for computing database repairs and consistent answers and it is shown that (preferred) repairs can be derived through the computation of (pre preferred) disjunctive stable models.

Bridging the gap between OWL and relational databases

TLDR
This work proposes an extension of OWL with ICs that captures the intuition behind ICs in relational databases, and discusses the algorithms for checking IC satisfaction for different types of knowledge bases, and shows that, if the constraints are satisfied, one can disregard them while answering a broad range of positive queries.

Optimizing Computation of Repairs from Active Integrity Constraints

TLDR
Two different relations on AICs are introduced: an equivalence relation of independence, allowing the search to be parallelized among the equivalence classes, and a precedence relation, inducing a stratification that allows repairs to be built progressively.

Logic and Databases: A Deductive Approach

TLDR
It is shown that logic provides a convenient formalism for studying classical database problems and the representation and manipulation of deduced facts and incomplete information is shown.

Updating knowledge bases while maintaining their consistency

TLDR
This work proposes a new method for updating knowledge bases while maintaining their consistency based on events and transition rules, an extension of the SLDNF procedure, which allows us to obtain all possible minimal ways of updating a knowledge base without violating any integrity constraint.