Pages that link to "Item:Q1204870"
From MaRDI portal
The following pages link to Structure identification in relational data (Q1204870):
Displaying 37 items.
- On minimal constraint networks (Q359976) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Operations and evaluation measures for learning possibilistic graphical models (Q814501) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- Double Horn functions (Q1271644) (← links)
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951) (← links)
- Positive and Horn decomposability of partially defined Boolean functions (Q1356507) (← links)
- Logical analysis of numerical data (Q1365054) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- The complexity of theory revision (Q1606294) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- Decomposability of partially defined Boolean functions (Q1900137) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- MPF problem over modified medial semigroup is NP-complete (Q2333870) (← links)
- Logical analysis of data -- the vision of Peter L. Hammer (Q2385443) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- On the hardness of approximate reasoning (Q2674206) (← links)
- Uncovering trees in constraint networks (Q2676569) (← links)
- Reasoning with models (Q2676579) (← links)
- (Q5091205) (← links)
- An algebraic characterization of tractable constraints (Q6085763) (← links)
