Learning a subclass of k-quasi-Horn formulas with membership queries

DOI10.1016/J.IPL.2011.03.008MaRDI QIDQ1944948zbMATH OpenOpenAlexFDO

Authors Víctor Lavín Puente

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

zbMATH Keywords

Boolean formulasquery learningtheory of computation

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
• Learning orthogonal F-Horn formulas
• Learning conjunctions of Horn clauses
• Conjunctions of unate DNF formulas: Learning and structure
• Learning closed Horn expressions

Cites work

• Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
• Learning conjunctions of Horn clauses
• Learning nearly monotone k-term DNF
• Learning regular sets from queries and counterexamples
• Monotone term decision lists
• On learning multivalued dependencies with queries
• Queries and concept learning
• Read-twice DNF formulas are properly learnable

Cited in

(7)

• Learning conjunctions of Horn clauses
• Learning orthogonal F-Horn formulas
• Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
• Learning a representation for optimizable formulas
• Learning sets of antecedent-restricted functional and multivalued dependencies with queries
• Learning definite Horn formulas from closure queries
• Learning orthogonal F-Horn formulas

This page was built for publication: Learning a subclass of \(k\)-quasi-Horn formulas with membership queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944948)