Horn clauses and database dependencies
From MaRDI portal
Cited in
(65)- Synthesis of unnormalized relations incorporating more meaning
- 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
- Inferences for numerical dependencies
- Non-finite specifiability of projections of functional dependency families
- Database survivability under dynamic constraints
- On renaming a set of clauses as a Horn set
- Join dependencies in relational-database design
- Inferring multivalued dependencies from functional and join dependencies
- Axioms and algorithms for inferences involving probabilistic independence
- Connection-trap-free database schemes
- On characterizing boundedness of database schemes with bounded dependencies
- Verification of knowledge bases based on containment checking
- Functional dependencies, supervenience, and consequence relations
- 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
- On the expressive power of data dependencies
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Constructing Armstrong tables for general cardinality constraints and not-null constraints
- Towards practical feasibility of core computation in data exchange
- Dependency types
- Possibilistic keys
- A general Lindström theorem for some normal modal logics
- Codes that attain minimum distance in every possible direction
- Reasoning about functional and full hierarchical dependencies over partial relations
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- The complexity of embedded axiomatization for a class of closed database views
- Reasoning with models
- On the data complexity of consistent query answering
- On the finite and general implication problems of independence atoms and keys
- Implication and axiomatization of functional and constant constraints
- Logical foundations of possibilistic keys
- Application of SQL/N to the attribute-relation associations implicit in functional dependencies
- Characterization of optimal complements of database views defined by projection
- Coding theory motivated by relational databases
- SPT(q, k, n)-Codes
- Relaxed notions of schema mapping equivalence revisited
- Spoilt for Choice: Full First-Order Hierarchical Decompositions
- A theory of data dependencies over relational expressions
- Solutions and query rewriting in data exchange
- Semantic query optimization in the presence of types
- Information-based distance measures and the canonical reflection of view updates
- SOME MODEL THEORY OF GUARDED NEGATION
- Integrity constraints revisited: from exact to approximate implication
- Information-Optimal Reflections of View Updates on Relational Database Schemata
- On the Existence of Armstrong Instances with Bounded Domains
- Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
- Data exchange: semantics and query answering
- Some characterizations of finitely specifiable implicational dependency families
- Partition semantics for relations
- Design by example: An application of Armstrong relations
- Cylindric structures and dependencies in relational databases
- Controlling entity integrity with key sets
- Hypergraph Horn functions
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Inclusion with repetitions and Boolean constants -- implication problems revisited
- Finite-model theory -- A personal perspective
- Characterizing data dependencies then and now
- Some results on the deductive structure of join dependencies
- Propagating XML constraints to relations
- A new interpretation for null values in the weak instance model
- Closed world assumptions having precedence in predicates
This page was built for publication: Horn clauses and database dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956433)