scientific article; zbMATH DE number 3823168
From MaRDI portal
Publication:3668890
Cited in
(only showing first 100 items - show all)- Procedural languages for database queries and updates
- Information Algebra
- Recursive conditioning
- Decomposability of partially defined Boolean functions
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
- Database survivability under dynamic constraints
- Fuzzy inequational logic
- Attribute-incremental construction of the canonical implication basis
- Attribute dependencies for data with grades I,
- Decomposing a relation into a tree of binary relations
- Derivation digraphs for dependencies in ordinal and similarity-based data
- Attribute exploration with background knowledge
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
- Cycle structure of edge labelled graphs
- On computing minimal independent support and its applications to sampling and counting
- Local and global relational consistency
- Boolean invariants of databases
- Probability propagation
- A Generalization of the Inference Rules for Join Dependencies in Databases
- A first step towards implementing dynamic algebraic dependences
- A corrected 5NF definition for relational database design
- Decision bireducts and decision reducts -- a comparison
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects
- Synthesis-analysis of derivation sequences of tables' functional dependences
- Correctness of semantic integrity checking in database management systems
- Towards an abstract theory of dependency constraints in relational databases
- On finding a worst-case optimal fourth normal form database decomposition
- Passive and active rules in deductive databases
- Extended Static Checking by Calculation Using the Pointfree Transform
- Boyce-Codd normal form and object normal forms
- scientific article; zbMATH DE number 7564632 (Why is no real title available?)
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- Lexico-Logical Acquisition of OWL DL Axioms
- A paraconsistent relational data model
- Join sizes, urn models and normal limiting distributions
- Constraint-generating dependencies
- Computing sets of graded attribute implications with witnessed non-redundancy
- A semantics for complex objects and approximate answers
- SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES
- Approximate inference of functional dependencies from relations
- Finite-model theory -- A personal perspective
- scientific article; zbMATH DE number 7471694 (Why is no real title available?)
- Independent database schemes under functional and inclusion dependencies
- Algebraization of inferring functional dependences in relational databases
- On sets of graded attribute implications with witnessed non-redundancy
- Database placement in communication networks for minimizing the overall transmission cost
- Fuzzy functional dependencies: a comparative survey
- Three views on dependency covers from an FCA perspective
- Weak Cartesian properties of simplicial sets
- Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
- Reformulation of global constraints based on constraints checkers
- Cheap Boolean Role Constructors for Description Logics
- The determining method about the conflict between the null constraints and the set of functional dependencies
- Computations with finite closure systems and implications
- The complexity of dependency detection and discovery in relational databases
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Completeness issues for join dependencies derived from the universal relation join dependency
- Set containment inference and syllogisms
- Testing unboundedness of database schemes and functional dependencies
- Uniform Constraint Satisfaction Problems and Database Theory
- Query languages for hierarchic databases
- A compact representation for modular semilattices and its applications
- An analytical approach to the inference of summary data of additive type
- Autonomous sets for the hypergraph of all canonical covers
- On characterizing boundedness of database schemes with bounded dependencies
- A semantic approach to optimize linear datalog programs
- Structure of closures in relational schemas with join and functional dependencies
- On keys and normal forms
- On improving dependency implication algorithms
- Graded LinClosure and Its Role in Relational Data Analysis
- Fast algorithms for implication bases and attribute exploration using proper premises
- A calculus for containment of fuzzy attributes
- An alternative characterization of a Bayesian network.
- Tractable constraints on ordered domains
- Relations, dependencies, and some problems of systems theory
- Relational decomposition and structural analysis of systems
- Null values in nested relational databases
- A generalisation of entity and referential integrity in relational databases
- Functional dependencies and normal forms in the fuzzy relational database model
- The calculus of context relations
- The implication problem for `closest node' functional dependencies in complete XML documents
- Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
- Closure via functional dependence simplification
- The multiple facets of the canonical direct unit implicational basis
- On functional dependencies in q-Horn theories
- RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS
- Minimal bases of temporal attribute implications
- A complete axiomatization of full acyclic join dependencies
- The reduction of the fuzzy data domain and fuzzy consistent join
- Fuzzy data dependencies and implication of fuzzy data dependencies
- Probabilistic databases for decision analysis
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
- Characterization of ordered bilinear contexts
- Computing unique canonical covers for simple FDs via transitive reduction
- Non first normal form relations: An algebra allowing data restructuring
- Partition semantics for relations
- A logical framework for depiction and image interpretation
- Unifying tree decompositions for reasoning in graphical models
- On the expressive power of database queries with intermediate types
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668890)
