Structure identification in relational data
From MaRDI portal
Publication:1204870
DOI10.1016/0004-3702(92)90009-MzbMath0782.68095MaRDI QIDQ1204870
Publication date: 1 April 1993
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items
The complexity of minimal satisfiability problems, Boolean analysis of incomplete examples, Positive and Horn decomposability of partially defined Boolean functions, Decomposability of partially defined Boolean functions, Logical analysis of data -- the vision of Peter L. Hammer, Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing, Logical analysis of numerical data, On minimal constraint networks, Error-free and best-fit extensions of partially defined Boolean functions, On the Boolean connectivity problem for Horn relations, On the hardness of approximate reasoning, Uncovering trees in constraint networks, Reasoning with models, An algebraic characterization of tractable constraints, The inverse satisfiability problem, Bidual Horn functions and extensions, Disjunctive closures for knowledge compilation, First order LUB approximations: characterization and algorithms, Approximate inference of functional dependencies from relations, Dualization in lattices given by ordered sets of irreducibles, Structure identification of Boolean relations and plain bases for co-clones, A subclass of Horn CNFs optimally compressible in polynomial time, The multiple facets of the canonical direct unit implicational basis, Tractable constraints in finite semilattices, Unnamed Item, Information loss in knowledge compilation: a comparison of Boolean envelopes, Learning from imprecise data: possibilistic graphical models., Tractable constraints on ordered domains, Tractable constraints on ordered domains, Double Horn functions, Unnamed Item, An efficient algorithm for Horn description, Disjoint essential sets of implicates of a CQ Horn function, Unnamed Item, MPF problem over modified medial semigroup is NP-complete, Conjunctive-query containment and constraint satisfaction, Horn approximations of empirical data, Approximating Minimum Representations of Key Horn Functions, Optimal compression of propositional Horn knowledge bases: Complexity and approximation, Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms, 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, Operations and evaluation measures for learning possibilistic graphical models, Theory revision with queries: Horn, read-once, and parity formulas
Cites Work
- Decomposing a relation into a tree of binary relations
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Learning conjunctions of Horn clauses
- Networks of constraints: Fundamental properties and applications to picture processing
- Queries and concept learning
- On the Desirability of Acyclic Database Schemes
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The Semantics of Predicate Logic as a Programming Language
- Approximating discrete probability distributions with dependence trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
