Communications of the ACM
On generating all maximal independent sets
Information Processing Letters
Functions comuted by monotone boolean formulas with no repeated variables
Theoretical Computer Science
The complexity of very simple Boolean formulas with applications
SIAM Journal on Computing
Cause-effect relationships and partially defined Boolean functions
Annals of Operations Research
Learning Nested Differences of Intersection-Closed Concept Classes
Machine Learning
Teachability in computational learning
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Computational learning theory: an introduction
Computational learning theory: an introduction
A computational model of teaching
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
Exact transversal hypergraphs and application to Boolean &mgr;-functions
Journal of Symbolic Computation
Journal of Computer and System Sciences
On specifying Boolean functions by labelled examples
Discrete Applied Mathematics
Lower bounds on learning decision lists and trees
Information and Computation
Journal of Computer and System Sciences
On the geometric separability of Boolean functions
Discrete Applied Mathematics
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation
Information and Computation
Complexity theoretic hardness results for query learning
Computational Complexity
Horn Extensions of a Partially Defined Boolean Function
SIAM Journal on Computing
Machine Learning
Machine Learning
Partial Occam's Razor and Its Applications
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Measuring teachability using variants of the teaching dimension
Theoretical Computer Science
Probabilistic and Logical Beliefs
Languages, Methodologies and Development Tools for Multi-Agent Systems
Teaching classes with high teaching dimension using few examples
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Minimum multiple characterization of biological data using partially defined boolean formulas
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 5.23 |
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decision lists has interesting relationships to independently defined classes such as disguised Horn functions, read-once functions, nested differences of concepts, threshold functions, and 2-monotonic functions. In particular, 1-decision lists coincide with fragments of the mentioned classes. We further investigate the recognition problem for this class, as well as the extension problem in the context of partially defined Boolean functions (pdBfs). We show that finding an extension of a given pdBf in the class of 1-decision lists is possible in linear time. This improves on previous results. Moreover, we present an algorithm for enumerating all such extensions with polynomial delay.