Verification of knowledge bases based on containment checking

DOI10.1016/S0004-3702(98)00021-6zbMath0909.68172MaRDI QIDQ1274279

Marie-Christine Rousset, Alon Y. Halevy

Publication date: 12 January 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

database theorydescription logicsquery containmenthybrid languagesHorn rulesknowledge base verification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items

Reductions and saturation reductions of (abstract) knowledge bases ⋮ \(\ast\)-reductions in a knowledge base ⋮ Combining Horn rules and description logics in CARIN ⋮ Relationships between knowledge bases and their uncertainty measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of querying indefinite data about linearly ordered domains
• The implication and finite implication problems for typed template dependencies
• Algebraic dependencies
• Information integration using logical views
• A Proof Procedure for Data Dependencies
• On conjunctive queries containing inequalities
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Horn clauses and database dependencies
• Equivalence of Datalog queries is undecidable
• Equivalences among Relational Expressions
• Programming as a Discipline of Mathematical Nature