C. Domingo, N. Mishra, and L. Pitt. Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries. Machine Learning, 37:89--110, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
New Results on Monotone Dualization and Generating Hypergraph.. - Eiter, al. (2002) (6 citations) (Correct)
.... H and G, whether G = Tr(H) DUALIZATION and several problems which are like transversal computation known to be computationally equivalent to problem DUALIZATION (see [15] are of interest in various areas such as database theory (e.g. 38, 49] machine learning and data mining (e.g. [6, 7, 12, 22]) game theory (e.g. 26, 42, 43] artificial intelligence (e.g. 21, 28, 29, 44] mathematical programming (e.g. 5] and distributed systems (e.g. 18, 27] to mention a few. While the output CNF can be exponential in the size of , it is currently not known whether can be computed in ....
....application areas, and given the long standing failure to settle the complexity of these problems, emphasis was put on finding tractable cases of DUAL and corresponding polynomial total time cases of DUALIZATION. In fact, several relevant tractable classes were found by various authors; see e.g. [4, 8, 9, 10, 12, 14, 15, 20, 35, 36, 39, 41] and references therein. Moreover, classes of formulas were identified on which INFSYS RR 1843 02 05 DUALIZATION is not just polynomial total time, but where the conjuncts of the dual formula can be enumerated with incremental polynomial delay, i.e. with delay polynomial in the size of the input ....
[Article contains additional citation context not shown here]
C. Domingo, N. Mishra and L. Pitt. Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries. Machine Learning, 37:89--110, 1999.
Almost all monotone Boolean functions are polynomially .. - Shmulevich.. (2001) (1 citation) Self-citation (Queries) (Correct)
....Science B.V. All rights reserved. Keywords: Monotone Boolean function; Learning; Membership query; Computational complexity 1. Introduction An important open problem in machine learning is whether monotone Boolean functions are exactly learnable in polynomial time using only membership queries [2,5,4,3]. Given access to a membership query oracle, a function is considered to be identified if both its CNF and DNF representations are explicitly obtained. The complexity of this identification problem is measured in terms of both the input and output sizes. The input size n is the number of variables ....
C. Domingo, N. Mishra, L. Pitt, Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries, Mach. Learning 37 (1) (1999) 89--110.
Abduction and the Dualization Problem - Eiter, Makino (2003) (Correct)
No context found.
C. Domingo, N. Mishra, and L. Pitt. Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries. Machine Learning, 37:89--110, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC