Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
From MaRDI portal
Publication:1944948
DOI10.1016/j.ipl.2011.03.008zbMath1260.68190OpenAlexW2048845520MaRDI QIDQ1944948
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.008
Related Items (2)
Learning with queries inside the class of unate \(k\)-quasi-Horn formulas ⋮ Learning sets of antecedent-restricted functional and multivalued dependencies with queries
Cites Work
- Learning nearly monotone \(k\)-term DNF
- On learning multivalued dependencies with queries
- Learning regular sets from queries and counterexamples
- Learning conjunctions of Horn clauses
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Queries and concept learning
- Read-twice DNF formulas are properly learnable
- Monotone term decision lists
This page was built for publication: Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
