scientific article; zbMATH DE number 3464827
From MaRDI portal
Publication:4050122
Cited in
(only showing first 100 items - show all)- Symmetry in information flow
- Minimum matrix representation of Sperner systems
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Database survivability under dynamic constraints
- Fuzzy inequational logic
- Attribute-incremental construction of the canonical implication basis
- Derivation digraphs for dependencies in ordinal and similarity-based data
- Group conformity in social networks
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Possibilistic keys
- Diversity, dependence and independence
- Armstrong databases for functional and inclusion dependencies
- The poset of closures as a model of changing databases
- Computing sets of graded attribute implications with witnessed non-redundancy
- Monotonic aggregation in deductive databases
- Characterisations of multivalued dependency implication over undetermined universes
- New perspectives of granular computing in relation geometry induced by pairings
- Comparing machine learning algorithms by union-free generic depth
- On propositional definability
- On sets of graded attribute implications with witnessed non-redundancy
- Dependence and independence
- Propositional logics of dependence
- Reduction of database independence to dividing in atomless Boolean algebras
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Completeness issues for join dependencies derived from the universal relation join dependency
- On the number of databases and closure operations
- Appropriate inferences of data dependencies in relational databases
- Autonomous sets for the hypergraph of all canonical covers
- On characterizing boundedness of database schemes with bounded dependencies
- Breaking the atom with Samson
- Set relations and set systems induced by some families of integral domains
- Questions as information types
- Computable queries for relational data bases
- New type of coding problem motivated by database theory
- Implication and axiomatization of functional and constant constraints
- Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel
- A calculus for containment of fuzzy attributes
- Strongly first order, domain independent dependencies: the union-closed case
- Some combinatorial characteristics of closure operations
- Charting the completeness frontier of inference systems for multivalued dependencies
- The multiple facets of the canonical direct unit implicational basis
- Deciding implication for functional dependencies in complex-value databases
- On functional dependencies in q-Horn theories
- Inclusion dependencies and their interaction with functional dependencies
- Minimal bases of temporal attribute implications
- Stochastic independence, algebraic independence and abstract connectedness
- The functional dependence relation on hypergraphs of secrets
- Partition semantics for relations
- The interaction of integrity constraints in an information system
- From IF to BI. A tale of dependence and separation
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Monoidal functional dependencies
- A theory of data dependencies over relational expressions
- On the normalization of relational databases
- Automated prover for attribute dependencies in data with grades
- A finite axiomatization of conditional independence and inclusion dependencies
- Surmise relations between tests -- preliminary results of the mathematical modeling
- Succinctness in dependency systems
- Functional dependencies in relations with null values
- Questions and dependency in intuitionistic logic
- SPT(q, k, n)-Codes
- Recent combinatorial results in the theory of relational databases
- Design by example: An application of Armstrong relations
- Notions from rough set theory in a generalized dependency relation context
- Characterizing downwards closed, strongly first-order, relativizable dependencies
- Dynamic epistemic logic of faith diffusion in cultural circles
- Databases and artificial intelligence
- Data summarization in relational databases through fuzzy dependencies
- Transitive fuzzy dependencies. II
- Generating a condensed representation for association rules
- Dependency relations
- Inference of mixed information in formal concept analysis
- Design type problems motivated by database theory
- Constructing Armstrong tables for general cardinality constraints and not-null constraints
- Codes that attain minimum distance in every possible direction
- Rationally functional dependence
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
- Testing for existence of a covering Boyce-Codd normal form
- Hyper-relations, choice functions, and orderings of opportunity sets
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- Axiomatisation of functional dependencies in incomplete relations
- On the Complexity of Computing Generators of Closed Sets
- The theory of functional and subset dependencies over relational expressions
- scientific article; zbMATH DE number 3823169 (Why is no real title available?)
- Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics
- Order dependency in the relational model
- A theory of well-connected relations
- On covering Boyce-Codd normal forms
- Axiomatizing functional dependencies in the higher-order entity-relationship model
- Non-deterministic ideal operators: an adequate tool for formalization in data bases
- Knowing values and public inspection
- Functional dependencies distorted by errors
- Adequacy of decompositions of relational databases
- Algebraic dependencies
- On the Merge of Factor Canonical Bases
- Irreversibility problem in NL-class relations
- Non-finite specifiability of projections of functional dependency families
- Logical foundations of possibilistic keys
- Axiomatizations of team logics
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 Q4050122)