Learning with queries inside the class of unate \(k\)-quasi-Horn formulas

DOI10.1007/s00354-015-0204-8zbMath1333.68155OpenAlexW1994907786MaRDI QIDQ264959

Víctor Lavín Puente

Publication date: 1 April 2016

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00354-015-0204-8

zbMATH Keywords

CNF formulasproper learningquery learningunate formulas

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Unnamed Item
• On learning multivalued dependencies with queries
• Learning regular sets from queries and counterexamples
• Learning conjunctions of Horn clauses
• Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
• Queries and concept learning
• Read-twice DNF formulas are properly learnable
• Learning read-once formulas with queries

This page was built for publication: Learning with queries inside the class of unate \(k\)-quasi-Horn formulas