Article

Exact learning of read-twice DNF formulas (extended abstract)

Authors:

Howard Aizenstein,

Leonard PittAuthors Info & Claims

SFCS '91: Proceedings of the 32nd annual symposium on Foundations of computer science

Pages 170 - 179

https://doi.org/10.1109/SFCS.1991.185366

Published: 01 September 1991 Publication History

Publisher Site

Abstract

A polynomial-time algorithm is presented for exactly learning the class of read-twice DNF formulas, i.e. Boolean formulas in disjunctive normal form where each variable appears at most twice. The (standard) protocol used allows the learning algorithm to query whether a given assignment of Boolean variables satisfies the DNF formula to be learned (membership queries), as well as to obtain counterexamples to the correctness of its current hypothesis which can be any arbitrary DNF formula (equivalence queries). The formula output by the learning algorithm is logically equivalent to the formula to be learned.

Cited By

View all

Kimelfeld BRé C(2018)A Relational Framework for Classifier EngineeringACM Transactions on Database Systems10.1145/326893143:3(1-36)Online publication date: 30-Oct-2018
https://dl.acm.org/doi/10.1145/3268931
Goldman S(2010)Computational learning theoryAlgorithms and theory of computation handbook10.5555/1882757.1882783(26-26)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.5555/1882757.1882783
Chen ZAmeur F(1999)The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized SpaceJournal of Computer and System Sciences10.1006/jcss.1999.162159:1(70-83)Online publication date: 1-Aug-1999
https://dl.acm.org/doi/10.1006/jcss.1999.1621
Show More Cited By

Index Terms

Exact learning of read-twice DNF formulas (extended abstract)
1. Theory of computation

Recommendations

Read-thrice DNF is hard to learn with membership and equivalence queries
SFCS '92: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

A general technique is developed to obtain nonlearnability results in the model of exact learning from equivalence and membership queries. The technique is applied to show that, assuming NP not=co-NP, there does not exist a polynomial-time membership ...
Learning conjunctions of Horn clauses
SFCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer Science

An algorithm for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses is presented. (A Horn clause is a disjunction of literals, all but at most one of which is a negated variable). The algorithm uses equivalence ...
Learning Behaviors of Automata from Multiplicity and Equivalence Queries

We consider the problem of identifying the behavior of an unknown automaton with multiplicity in the field $\Ratviii$ of rational numbers ($\Ratviii$-automaton) from multiplicity and equivalence queries. We provide an algorithm which is polynomial in ...

Comments

Information & Contributors

Information

Published In

SFCS '91: Proceedings of the 32nd annual symposium on Foundations of computer science

September 1991

824 pages

ISBN:0818624450

Chairman:
Christos Papadimitriou
Univ. of California at San Diego, La Jolla

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 September 1991

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kimelfeld BRé C(2018)A Relational Framework for Classifier EngineeringACM Transactions on Database Systems10.1145/326893143:3(1-36)Online publication date: 30-Oct-2018
https://dl.acm.org/doi/10.1145/3268931
Goldman S(2010)Computational learning theoryAlgorithms and theory of computation handbook10.5555/1882757.1882783(26-26)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.5555/1882757.1882783
Chen ZAmeur F(1999)The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized SpaceJournal of Computer and System Sciences10.1006/jcss.1999.162159:1(70-83)Online publication date: 1-Aug-1999
https://dl.acm.org/doi/10.1006/jcss.1999.1621
Tadepalli PRussell S(1998)Learning from Examples and Membership Queries with Structured DeterminationsMachine Language10.1023/A:100742131581332:3(245-295)Online publication date: 1-Sep-1998
https://dl.acm.org/doi/10.1023/A%3A1007421315813
Goldman SKwek SScott SFreund YSchapire R(1997)Learning from examples with unspecified attribute values (extended abstract)Proceedings of the tenth annual conference on Computational learning theory10.1145/267460.267504(231-242)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1145/267460.267504
Jackson J(1997)An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform DistributionJournal of Computer and System Sciences10.1006/jcss.1997.153355:3(414-440)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.1006/jcss.1997.1533
Kushilevitz EBlum AKearns M(1996)A simple algorithm for learning O(log n)-term DNFProceedings of the ninth annual conference on Computational learning theory10.1145/238061.238115(266-269)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/238061.238115
Angluin DKharitonov M(1995)When Won't Membership Queries Help?Selected papers of the 23rd annual ACM symposium on Theory of computing10.5555/207388.207386(336-355)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.5555/207388.207386
Bshouty NJackson JMaass W(1995)Learning DNF over the uniform distribution using a quantum example oracleProceedings of the eighth annual conference on Computational learning theory10.1145/225298.225312(118-127)Online publication date: 5-Jul-1995
https://dl.acm.org/doi/10.1145/225298.225312
Mansour Y(1995)An O(nlog log n) Learning Algorithm for DNF under the Uniform DistributionJournal of Computer and System Sciences10.1006/jcss.1995.104350:3(543-550)Online publication date: 1-Jun-1995
https://dl.acm.org/doi/10.1006/jcss.1995.1043
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Read-thrice DNF is hard to learn with membership and equivalence queries

Learning conjunctions of Horn clauses

Learning Behaviors of Automata from Multiplicity and Equivalence Queries

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations