Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices

DOI10.1007/978-3-642-20514-9_5zbMath1326.68281OpenAlexW1513865639MaRDI QIDQ3003407

Mikhail A. Babin, Sergei O. Kuznetsov

Publication date: 27 May 2011

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20514-9_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Boolean functions (06E30)

Cites Work

• Complexity of learning in concept lattices from positive and negative examples
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Conceptual Structures for Knowledge Creation and Communication
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices