Horn clauses and database dependencies
From MaRDI portal
Publication:3956433
DOI10.1145/322344.322347zbMath0493.68092OpenAlexW2171094216WikidataQ114614030 ScholiaQ114614030MaRDI QIDQ3956433
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322344.322347
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (61)
On the data complexity of consistent query answering ⋮ On the finite and general implication problems of independence atoms and keys ⋮ Inferences for numerical dependencies ⋮ Non-finite specifiability of projections of functional dependency families ⋮ Implication and axiomatization of functional and constant constraints ⋮ Database survivability under dynamic constraints ⋮ Domain independence and the relational calculus ⋮ Characterization of desirable properties of general database decompositions. ⋮ Logical and algorithmic properties of independence and their application to Bayesian networks ⋮ A general Lindström theorem for some normal modal logics ⋮ Relaxed notions of schema mapping equivalence revisited ⋮ On renaming a set of clauses as a Horn set ⋮ Join dependencies in relational-database design ⋮ Logical Foundations of Possibilistic Keys ⋮ Propagating XML constraints to relations ⋮ Solutions and query rewriting in data exchange ⋮ Semantic query optimization in the presence of types ⋮ Reasoning with models ⋮ SPT(q, k, n)-Codes ⋮ Controlling entity integrity with key sets ⋮ Codes that attain minimum distance in every possible direction ⋮ Information-based distance measures and the canonical reflection of view updates ⋮ A new interpretation for null values in the weak instance model ⋮ Inferring multivalued dependencies from functional and join dependencies ⋮ Closed world assumptions having precedence in predicates ⋮ Reasoning about functional and full hierarchical dependencies over partial relations ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Unnamed Item ⋮ Axioms and algorithms for inferences involving probabilistic independence ⋮ Connection-trap-free database schemes ⋮ SOME MODEL THEORY OF GUARDED NEGATION ⋮ On characterizing boundedness of database schemes with bounded dependencies ⋮ Finite-model theory -- A personal perspective ⋮ Constructing Armstrong tables for general cardinality constraints and not-null constraints ⋮ Application of SQL/N to the attribute-relation associations implicit in functional dependencies ⋮ Data exchange: semantics and query answering ⋮ Towards practical feasibility of core computation in data exchange ⋮ Some characterizations of finitely specifiable implicational dependency families ⋮ The complexity of embedded axiomatization for a class of closed database views ⋮ Partition semantics for relations ⋮ Design by example: An application of Armstrong relations ⋮ Dependency types ⋮ Information-Optimal Reflections of View Updates on Relational Database Schemata ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Cylindric structures and dependencies in relational databases ⋮ Characterization of Optimal Complements of Database Views Defined by Projection ⋮ Coding Theory Motivated by Relational Databases ⋮ Spoilt for Choice: Full First-Order Hierarchical Decompositions ⋮ Verification of knowledge bases based on containment checking ⋮ On the expressive power of data dependencies ⋮ Possibilistic keys ⋮ Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context ⋮ A theory of data dependencies over relational expressions ⋮ Some results on the deductive structure of join dependencies ⋮ Synthesis of unnormalized relations incorporating more meaning ⋮ The implication problem for functional dependencies and variants of marginal distribution equivalences ⋮ Order dependency in the relational model ⋮ Characterizations for functional dependency and Boyce-Codd normal form families ⋮ Inclusion dependencies and their interaction with functional dependencies ⋮ The implication and finite implication problems for typed template dependencies ⋮ Functional dependencies, supervenience, and consequence relations
This page was built for publication: Horn clauses and database dependencies
