Structure identification in relational data
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- Approximating discrete probability distributions with dependence trees
- Decomposing a relation into a tree of binary relations
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 42816 (Why is no real title available?)
- scientific article; zbMATH DE number 140408 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3290846 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learning conjunctions of Horn clauses
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- On the Desirability of Acyclic Database Schemes
- Queries and concept learning
- The Semantics of Predicate Logic as a Programming Language
- Tree clustering for constraint networks
Cited in
(54)- An efficient algorithm for Horn description
- Double Horn functions
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- Positive and Horn decomposability of partially defined Boolean functions
- Logical analysis of numerical data
- Error-free and best-fit extensions of partially defined Boolean functions
- Conjunctive-query containment and constraint satisfaction
- Ordered binary decision diagrams as knowledge-bases
- The complexity of theory revision
- Logical analysis of binary data with missing bits
- On functional dependencies in q-Horn theories
- Relational data factorization
- Inverted structure -- a relational model for data identification
- Logical analysis of data with decomposable structures.
- Horn approximations of empirical data
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- The complexity of minimal satisfiability problems
- Decomposability of partially defined Boolean functions
- Bidual Horn functions and extensions
- MPF problem over modified medial semigroup is NP-complete
- Logical analysis of data -- the vision of Peter L. Hammer
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
- First order LUB approximations: characterization and algorithms
- On the hardness of approximate reasoning
- Uncovering trees in constraint networks
- Reasoning with models
- scientific article; zbMATH DE number 1696655 (Why is no real title available?)
- Multi‐level decomposition of probabilistic relations
- On minimal constraint networks
- Disjunctive closures for knowledge compilation
- Relative entailment among probabilistic implications
- Tractable constraints in finite semilattices
- Boolean analysis of incomplete examples
- Dualization in lattices given by ordered sets of irreducibles
- Algorithmically efficient syntactic characterization of possibility domains
- Algorithmically efficient syntactic characterization of possibility domains
- Relational and Kleene-Algebraic Methods in Computer Science
- Approximating minimum representations of key Horn functions
- Tractable constraints on ordered domains
- Tractable constraints on ordered domains
- Learning from imprecise data: possibilistic graphical models.
- On the Boolean connectivity problem for Horn relations
- An algebraic characterization of tractable constraints
- The inverse satisfiability problem
- Learning Horn envelopes via queries from language models
- Approximate inference of functional dependencies from relations
- A subclass of Horn CNFs optimally compressible in polynomial time
- Representation results for belief update in closed fragments of propositional logic
- Disjoint essential sets of implicates of a CQ Horn function
- Operations and evaluation measures for learning possibilistic graphical models
- Theory revision with queries: Horn, read-once, and parity formulas
- Structure identification of Boolean relations and plain bases for co-clones
- The multiple facets of the canonical direct unit implicational basis
- Information loss in knowledge compilation: a comparison of Boolean envelopes
This page was built for publication: Structure identification in relational data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1204870)
