A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Artificial Intelligence
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Foundations of deductive databases and logic programming
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalence of datalog queries is undecidable
Journal of Logic Programming
The complexity of querying indefinite information: defined relations, recursion and linear order
The complexity of querying indefinite information: defined relations, recursion and linear order
International Journal of Expert Systems - Special issue on verification and validation (Part 2)
Subsumption anomalies in hybrid knowledge bases
International Journal of Expert Systems - Special issue on verification and validation (Part 2)
Inconsistency and redundancy checking for quasi-first-order-logic knowledge bases
International Journal of Expert Systems - Special issue on verification and validation (Part 2)
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
A Discipline of Programming
The inference problem for template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
A Terminological Knowledge Representation System with Complete Inference Algorithms
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
The GMAP: a versatile tool for physical data independence
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Decidable reasoning in terminological knowledge representation systems
Journal of Artificial Intelligence Research
Detecting redundant production rules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
The limits on combining recursive horn rules with description logics
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Applications of Abduction: Testing Very Long Qualitative Simulations
IEEE Transactions on Knowledge and Data Engineering
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Logic-based knowledge representation
Artificial intelligence today
On the decidability and complexity of identity knowledge representation
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Containment of regular path queries under description logic constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Data complexity of query answering in description logics
Artificial Intelligence
Reductions and Saturation Reductions of (Abstract) Knowledge Bases
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Building complex knowledge based applications requires encoding large amounts of domain knowledge. After acquiring knowledge from domain experts, much of the effort in building a knowledge base goes into verifying that the knowledge is encoded correctly. A knowledge base is verified if it can be shown that certain constraints always hold between the inputs and the outputs. We consider the knowledge base verification problem for Horn rule knowledge bases and for three kinds of constraints: I/O consistency constraints, I/O dependency constraints, and input completeness constraints. For the first two cases, we establish tight complexity results on the problem, and show in what cases it is decidable. In the third case, we show that the problem is, in general, undecidable, and we identify two decidable cases. In our analysis we show how the properties of the problem vary depending on the presence of recursion in the Horn rules, the presence of the interpreted predicates =, = and the presence of negation in the antecedents of the rules. Our approach to the verification problem is based on showing a close relationship to the problem of query containment, studied in the database literature. This connection also provides novel algorithms for the knowledge base verification problem. Finally, we provide the first algorithm for verifying hybrid knowledge bases that combine the expressive power of Horn rules and the description logicALCNR.