Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
First order logic formalization for functional, multivalued and mutual dependencies
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Principles of Database Systems
Principles of Database Systems
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Equivalence of relational database schemes
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A complete axiomatization for a large class of dependencies in relational datatbases
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Notions of dependency satisfaction
Journal of the ACM (JACM) - The MIT Press scientific computation series
Proof-tree transformation theorems and their applications
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
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
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Perspectives on database theory
ACM SIGACT News
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Testing containment of conjunctive queries under functional and inclusion dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The inference problem for template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The implication and finite implication problems for typed template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An Equational Chase for Path-Conjunctive Queries, Constraints, and Views
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
Optimizing away joins on data streams
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Ontological query answering with existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Towards farsighted dependencies for existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
ACM Transactions on Database Systems (TODS)
Walking the complexity lines for generalized guarded existential rules
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
It is shown that the general inference problem for embedded implicational dependencies (EIDs) is undecidable. For the more important case of finite inference (i.e., inference for finite data bases), the problem is not even recursively enumerable (r.e.); rather, it is complete in co-r.e. These results hold even for typed EIDs without equality, as well as for (untyped) template dependencies. The case for typed template dependencies remains open. The complexity of the inference problem for full dependencies has also been characterized - it is complete in exponential time for full implicational dependencies, and even for full typed template dependencies.