Minimal samples of positive examples identifying \(k\)-CNF Boolean functions

DOI10.1006/INCO.1994.1070zbMATH Open0821.68104OpenAlexW2003044976MaRDI QIDQ1333259

Andrew T. Ogielski

Publication date: 19 September 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1070

zbMATH Keywords

learning algorithmBoolean function

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A decomposition method for CNF minimality proofs 👍 👎
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach 👍 👎
• On specifying Boolean functions by labelled examples 👍 👎
• Computing the minimum DNF representation of Boolean functions defined by intervals 👍 👎
• Complexity of identification and dualization of positive Boolean functions 👍 👎
• On extremal \(k\)-CNF formulas 👍 👎
• Minimally unsatisfiable \(CNF\) formulas 👍 👎
• Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices 👍 👎

This page was built for publication: Minimal samples of positive examples identifying \(k\)-CNF Boolean functions

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