Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries
We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times ("read-k" monotone CNF). Let f : {0,1}^sup n^ [arrow right] {0,1} be expressible as a read-k monotone CNF formula for some natural number k. We give an incremental output polynomia...
Saved in:
| Published in: | Machine learning Vol. 37; no. 1; pp. 89 - 110 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Dordrecht
Springer Nature B.V
01.10.1999
|
| Subjects: | |
| ISSN: | 0885-6125, 1573-0565 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!