A Proof Procedure for Data Dependencies
From MaRDI portal
Publication:3770004
DOI10.1145/1634.1636zbMath0632.68097OpenAlexW2028222220WikidataQ114614168 ScholiaQ114614168MaRDI QIDQ3770004
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1634.1636
Related Items
Unnamed Item, Non-finite specifiability of projections of functional dependency families, The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems, Implication and axiomatization of functional and constant constraints, UPDATE TRANSLATION IN INSTANCE MAPPED HETEROGENEOUS PEER DATABASES, Dependencies in relational models of databases, A finite axiomatization of conditional independence and inclusion dependencies, Exploring Theories with a Model-Finding Assistant, Unnamed Item, On a general class of data dependencies in the relational model and its implication problems, A semantic approach to optimize linear datalog programs, Incomplete deductive databases, Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies, On the desirability of \(\gamma\)-acyclic BCNF database schemes, Testing unboundedness of database schemes and functional dependencies, Relaxed notions of schema mapping equivalence revisited, Theory of information aspects ? A tool to control independence and redundancy of information in database, Propagating XML constraints to relations, Using views to generate efficient evaluation plans for queries, Preserving Constraints with the Stable Chase, Extending inclusion dependencies with conditions, Unnamed Item, Solutions and query rewriting in data exchange, Semantic query optimization in the presence of types, Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?, The notion of abstraction in ontology-based data management, Restricted Chase Termination: A Hierarchical Approach and Experimentation, On measuring inconsistency in definite and indefinite databases with denial constraints, Information-based distance measures and the canonical reflection of view updates, Query languages for data exchange: beyond unions of conjunctive queries, On rules with existential variables: walking the decidability line, Inferring multivalued dependencies from functional and join dependencies, Connection-trap-free database schemes, Fuzzy data exchange, Inferring null join dependencies in relational databases, On characterizing boundedness of database schemes with bounded dependencies, On the finite controllability of conjunctive query answering in databases under open-world assumption, Preservation of integrity constraints in definite DATALOG programs, XML queries and constraints, containment and reformulation, Data exchange: semantics and query answering, Towards practical feasibility of core computation in data exchange, The complexity of embedded axiomatization for a class of closed database views, Partition semantics for relations, Unnamed Item, Unnamed Item, A framework for comparing query languages in their ability to express Boolean queries, Semi-oblivious chase termination: the sticky case, Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation, Characterizing Boundedness in Chase Variants, Querying Weak Instances Under Extension Chase Semantics: A Complete Solution, Constraint-generating dependencies, Verification of knowledge bases based on containment checking, A Fuzzy Extension of Data Exchange, On the expressive power of data dependencies, Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context, Schema Mappings: A Case of Logical Dynamics in Database Theory, Formal systems for join dependencies
