The following pages link to (Q4050122):
Displaying 50 items.
- Hyper-relations, choice functions, and orderings of opportunity sets (Q2516125) (← links)
- A finite axiomatization of conditional independence and inclusion dependencies (Q2629853) (← links)
- Axiomatizations of team logics (Q2636536) (← links)
- On the number of databases and closure operations (Q2638763) (← links)
- Attribute reduction using functional dependency relations in rough set theory (Q2670889) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Surmise relations between tests -- preliminary results of the mathematical modeling (Q2741273) (← links)
- Logical Foundations of Possibilistic Keys (Q2938493) (← links)
- The Functional Dependence Relation on Hypergraphs of Secrets (Q3092291) (← links)
- Constraints in RDF (Q3092320) (← links)
- The Logic of Approximate Dependence (Q3299846) (← links)
- SPT(q, k, n)-Codes (Q3503498) (← links)
- (Q3668891) (← links)
- A theory of data dependencies over relational expressions (Q3670613) (← links)
- (Q3685241) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- Tableaux for functional dependencies and independencies (Q4610339) (← links)
- Breaking the Atom with Samson (Q4922090) (← links)
- On Functional Dependencies in Advanced Data Models (Q4924533) (← links)
- Scalable Visual Analytics in FCA (Q5054985) (← links)
- Formal Methods in FCA and Big Data (Q5054986) (← links)
- A Port Graph Rewriting Approach to Relational Database Modelling (Q5097637) (← links)
- (Q5130676) (← links)
- CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES (Q5195061) (← links)
- Grelling on Dependence (Q5213640) (← links)
- Inference of Mixed Information in Formal Concept Analysis (Q5215754) (← links)
- Knowing Values and Public Inspection (Q5224492) (← links)
- On Dependence Logic (Q5249667) (← links)
- Optimal Codes in the Enomoto-Katona Space (Q5364232) (← links)
- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes (Q5445293) (← links)
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory (Q5445294) (← links)
- On the Existence of Armstrong Instances with Bounded Domains (Q5445299) (← links)
- On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)
- On the Merge of Factor Canonical Bases (Q5445333) (← links)
- Diversity, dependence and independence (Q5918485) (← links)
- Generic dependencies and database design (Q5948706) (← links)
- Normal forms and syntactic completeness proofs for functional independencies (Q5958763) (← links)
- Automated prover for attribute dependencies in data with grades (Q5963137) (← links)
- Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts (Q6057386) (← links)
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES (Q6103455) (← links)
- Strongly first order, domain independent dependencies: the union-closed case (Q6160748) (← links)
- Formal concept analysis for the generation of plural referring expressions (Q6186857) (← links)
- Explaining data with formal concept analysis (Q6535986) (← links)
- Comparing machine learning algorithms by union-free generic depth (Q6570318) (← links)
- Dynamic epistemic logic of faith diffusion in cultural circles (Q6601686) (← links)
- Databases and artificial intelligence (Q6602264) (← links)
- Relational schemas with multiplicity bounds, diversity bounds and functional dependencies (Q6630185) (← links)
- Axiomatization of implication for probabilistic independence and unary variants of marginal identity and marginal distribution equivalence (Q6630197) (← links)
- The implication problem for functional dependencies and variants of marginal distribution equivalences (Q6636619) (← links)
