Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
From MaRDI portal
Publication:1961324
DOI10.1023/A:1007627028578zbMath0948.68097MaRDI QIDQ1961324
Nina Mishra, Leonard Pitt, Carlos Domingo
Publication date: 22 November 2000
Published in: Machine Learning (Search for Journal in Brave)
Related Items (23)
Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ A global parallel algorithm for the hypergraph transversal problem ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ Learning a subclass of \(k\)-quasi-Horn formulas with membership queries ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Computational aspects of monotone dualization: a brief survey ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Self-duality of bounded monotone Boolean functions and related problems ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Generating dual-bounded hypergraphs ⋮ On the fractional chromatic number of monotone self-dual Boolean functions ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices ⋮ The complexity of dependency detection and discovery in relational databases ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms ⋮ Almost all monotone Boolean functions are polynomially learnable using membership queries ⋮ Version spaces and the consistency problem
This page was built for publication: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
