Add to ORKGCombinatorial and learnability results are proven for projective disjunctive normal forms, a class of DNF expressions introduced by Valiant. Dedicated to Prof. Peter Hammer on the occasion of his 70th birthday.
Since its introduction by Valiant in 1984, PAC learning of DNF expressions remains one of the centra...
A pseudo-Boolean function (pBf) is a mapping from {0,1}^n to the real numbers. It is known that pseu...
AbstractA central topic in query learning is to determine which classes of Boolean formulas are effi...
AbstractCombinatorial and learnability results are proven for projective disjunctive normal forms, a...
We show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctive normal...
AbstractWe show that read-twice DNF formulas-Boolean formulas in disjunctive normal form in which ea...
AbstractWe show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctiv...
Abstract We present new results, both positive and negative, on the well-studied problem of learning...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
132 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.The learnability of disjuncti...
AbstractGiven a disjunctive normal form (DNF) expression ϕ and a set A of vectors satisfying the exp...
A central topic in query learning is to determine which classes of Boolean formulas are efficiently ...
AbstractThis paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) ϕ can be dualize...
Abstract. The paper presents two new compilation schemes of De-composable Negation Normal Form (DNNF...
AbstractThe learnability of the class of exclusive-or expansions based on monotone DNF formulas is i...
Since its introduction by Valiant in 1984, PAC learning of DNF expressions remains one of the centra...
A pseudo-Boolean function (pBf) is a mapping from {0,1}^n to the real numbers. It is known that pseu...
AbstractA central topic in query learning is to determine which classes of Boolean formulas are effi...
AbstractCombinatorial and learnability results are proven for projective disjunctive normal forms, a...
We show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctive normal...
AbstractWe show that read-twice DNF formulas-Boolean formulas in disjunctive normal form in which ea...
AbstractWe show how to learn in polynomial time monotone d-term DNF formulae (formulae in disjunctiv...
Abstract We present new results, both positive and negative, on the well-studied problem of learning...
Recently, Valiant introduced a computational model of learning, and gave a precice definition of lea...
132 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.The learnability of disjuncti...
AbstractGiven a disjunctive normal form (DNF) expression ϕ and a set A of vectors satisfying the exp...
A central topic in query learning is to determine which classes of Boolean formulas are efficiently ...
AbstractThis paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) ϕ can be dualize...
Abstract. The paper presents two new compilation schemes of De-composable Negation Normal Form (DNNF...
AbstractThe learnability of the class of exclusive-or expansions based on monotone DNF formulas is i...
Since its introduction by Valiant in 1984, PAC learning of DNF expressions remains one of the centra...
A pseudo-Boolean function (pBf) is a mapping from {0,1}^n to the real numbers. It is known that pseu...
AbstractA central topic in query learning is to determine which classes of Boolean formulas are effi...