scientific article
From MaRDI portal
Publication:4050122
zbMath0296.68038MaRDI QIDQ4050122
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Computing sets of graded attribute implications with witnessed non-redundancy ⋮ Logic of temporal attribute implications ⋮ A calculus for containment of fuzzy attributes ⋮ On a problem of Fagin concerning multivalued dependencies in relational databases ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ New type of coding problem motivated by database theory ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Dependencies in relational models of databases ⋮ A finite axiomatization of conditional independence and inclusion dependencies ⋮ Scalable Visual Analytics in FCA ⋮ Formal Methods in FCA and Big Data ⋮ Axiomatizations of team logics ⋮ On the number of databases and closure operations ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Attribute-incremental construction of the canonical implication basis ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ Full hierarchical dependencies in fixed and undetermined universes ⋮ Data-informed knowledge and strategies ⋮ On propositional definability ⋮ Unnamed Item ⋮ Logical Foundations of Possibilistic Keys ⋮ Questions and dependency in intuitionistic logic ⋮ Some results about normal forms for functional dependency in the relational datamodel ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ Attribute reduction using functional dependency relations in rough set theory ⋮ Independence in information spaces ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Group conformity in social networks ⋮ Unique key Horn functions ⋮ A Port Graph Rewriting Approach to Relational Database Modelling ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ SPT(q, k, n)-Codes ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ Codes that attain minimum distance in every possible direction ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Granular computing on information tables: families of subsets and operators ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ Optimal Codes in the Enomoto-Katona Space ⋮ Tableaux for functional dependencies and independencies ⋮ Questions as information types ⋮ Dependence and independence ⋮ An extension of classical functional dependency: Dynamic fuzzy functional dependency ⋮ Extracting credible dependencies for averaged one-dependence estimator analysis ⋮ Reasoning about functional and full hierarchical dependencies over partial relations ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Data summarization in relational databases through fuzzy dependencies ⋮ The Logic of Approximate Dependence ⋮ Unnamed Item ⋮ A simple logic of functional dependence ⋮ On sets of graded attribute implications with witnessed non-redundancy ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Unnamed Item ⋮ Functional dependencies distorted by errors ⋮ Non-deterministic ideal operators: an adequate tool for formalization in data bases ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Constructing Armstrong tables for general cardinality constraints and not-null constraints ⋮ Breaking the Atom with Samson ⋮ On Functional Dependencies in Advanced Data Models ⋮ Dependency relations ⋮ A complete axiomatization of fuzzy functional dependencies using fuzzy function ⋮ Generating a condensed representation for association rules ⋮ Functional and approximate dependency mining: database and FCA points of view ⋮ Negation and partial axiomatizations of dependence and independence logic revisited ⋮ Generic dependencies and database design ⋮ Functional and multivalued dependencies in nested databases generated by record and list constructor ⋮ On minimum matrix representation of closure operations ⋮ Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On the Merge of Factor Canonical Bases ⋮ Normal forms and syntactic completeness proofs for functional independencies ⋮ Automated prover for attribute dependencies in data with grades ⋮ Hyper-relations, choice functions, and orderings of opportunity sets ⋮ Diversity, dependence and independence ⋮ Set relations and set systems induced by some families of integral domains ⋮ On composition of bounded-recall plans ⋮ Grelling on Dependence ⋮ Inference of Mixed Information in Formal Concept Analysis ⋮ Perfect error-correcting databases ⋮ Knowing Values and Public Inspection ⋮ The Functional Dependence Relation on Hypergraphs of Secrets ⋮ Constraints in RDF ⋮ Unnamed Item ⋮ The theory of functional and subset dependencies over relational expressions ⋮ Possibilistic keys ⋮ On Dependence Logic ⋮ A theory of data dependencies over relational expressions ⋮ The implication problem for functional dependencies and variants of marginal distribution equivalences ⋮ Monoidal functional dependencies ⋮ A simple characterization of database dependency implication ⋮ Non-finite specifiability of projections of functional dependency families ⋮ Propositional logics of dependence ⋮ Independent database schemas ⋮ Interactions between dependencies and nested relational structures ⋮ A note on relation schemes which are in 3NF but not in BCNF ⋮ Reduction of database independence to dividing in atomless Boolean algebras
This page was built for publication:
