Canonical Horn Representations and Query Learning

DOI10.1007/978-3-642-04414-4_16zbMath1262.68059OpenAlexW1873174914MaRDI QIDQ3648750

José L. Balcázar, Marta Arias

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/87970

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (6)

Directed hypergraphs and Horn minimization ⋮ Unique key Horn functions ⋮ Construction and learnability of canonical Horn formulas ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Learning definite Horn formulas from closure queries ⋮ A compact representation for modular semilattices and its applications

Cites Work

• Unnamed Item
• Learning conjunctions of Horn clauses
• A theory of finite closure spaces based on implications
• Queries revisited.
• When won't membership queries help?
• Polynomial certificates for propositional classes
• Toward Mechanical Mathematics
• Query Learning and Certificates in Lattices
• How many queries are needed to learn?

This page was built for publication: Canonical Horn Representations and Query Learning