Pages that link to "Item:Q1207302"
From MaRDI portal
The following pages link to Learning conjunctions of Horn clauses (Q1207302):
Displaying 50 items.
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas (Q264959) (← links)
- Learning an extension of the class of functional dependencies with queries (Q264983) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries (Q503461) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- On learning multivalued dependencies with queries (Q533874) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Classic learning (Q676240) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Efficient multiple constraint acquisition (Q823769) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- Structure identification in relational data (Q1204870) (← links)
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- Logical settings for concept-learning (Q1389603) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- Learning orthogonal F-Horn formulas (Q1390949) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Exact learning of multivalued dependency formulas (Q1704556) (← links)
- Extremal numbers for directed hypergraphs with two edges (Q1753023) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Learning closed Horn expressions (Q1854564) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Negative results on learning multivalued dependencies with queries (Q1944177) (← links)
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (Q1944948) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Learning function-free Horn expressions (Q1969319) (← links)
- Approximate computation of exact association rules (Q2117123) (← links)
- MCP: capturing big data by satisfiability (tool description) (Q2118299) (← links)
- Learning a propagation complete formula (Q2170198) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- Optimizations in computing the Duquenne-Guigues basis of implications (Q2248528) (← links)
- Probably approximately correct learning of Horn envelopes from queries (Q2286380) (← links)
- Rethinking epistemic logic with belief bases (Q2307332) (← links)
- A representation of antimatroids by Horn rules and its application to educational systems (Q2403022) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- From equivalence queries to PAC learning: the case of implication theories (Q2658016) (← links)
- Exact Learning of Multivalued Dependencies (Q2835618) (← links)
- Canonical Horn Representations and Query Learning (Q3648750) (← links)
- Combinatorial Problems for Horn Clauses (Q3655139) (← links)
- (Q4558528) (← links)
- (Q4625699) (← links)
