Verification of knowledge bases based on containment checking
From MaRDI portal
Publication:1274279
DOI10.1016/S0004-3702(98)00021-6zbMATH Open0909.68172MaRDI QIDQ1274279FDOQ1274279
Authors: Marie-Christine Rousset, A. Levy 
Publication date: 12 January 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
database theorydescription logicsquery containmenthybrid languagesHorn rulesknowledge base verification
Cites Work
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Horn clauses and database dependencies
- The complexity of querying indefinite data about linearly ordered domains
- A Proof Procedure for Data Dependencies
- On conjunctive queries containing inequalities
- Equivalences among Relational Expressions
- Programming as a Discipline of Mathematical Nature
- Title not available (Why is that?)
- Equivalence of Datalog queries is undecidable
- Information integration using logical views
- Algebraic dependencies
- The implication and finite implication problems for typed template dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Verifying Context-Dependent Reduction Relations for Knowledge Specifications
- Relationships between knowledge bases and their uncertainty measures
- Reductions and saturation reductions of (abstract) knowledge bases
- Combining Horn rules and description logics in CARIN
- \(\ast\)-reductions in a knowledge base
- A semantical perspective on verification of knowledge
- A formal model for verification of dynamic consistency of KBSs
This page was built for publication: Verification of knowledge bases based on containment checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274279)
