Results 211 to 220 of about 23,608 (225)
Some of the next articles are maybe not open access.
Engineering an Efficient Approximate DNF-Counter
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023Model counting is a fundamental problem with many practical applications, including query evaluation in probabilistic databases and failure-probability estimation of networks. In this work, we focus on a variant of this problem where the underlying formula is expressed in Disjunctive Normal Form (DNF), also known as #DNF.
Mate Soos +4 more
openaire +1 more source
Exact learning of read- k disjoint DNF and not-so-disjoint DNF
Proceedings of the fifth annual workshop on Computational learning theory, 1992A polynomial-time algorithm is presented for exactly learning the class of read-k disjoint DNF formulas—boolean formulas in disjunctive normal form where each variable appears at most k) and every assignment to the variables satisfies at most one term of F.
Howard Aizenstein, Leonard Pitt
openaire +1 more source
A DNF without Regular Shortest Consensus Path
SIAM Journal on Computing, 1987Exhibiting a disjunctive normal form without regular shortest consensus path, the authors give a negative answer to a question posed by \textit{G. S. Tsejtin} [Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 8, 234-259 (1968; Zbl 0197.001)].
Huang, Wenqi, Yu, Xiangdong
openaire +1 more source
Vector DNF for Datasets Classifications
2011Traditional classification approaches consider a dataset formed by an archive of observations classified as positive or negative according to a binary classification rule. In this paper we consider the Financial Timing Decision Problem which is the problem of deciding the time when it is profitable for the investor to buy shares or to sell shares or to
Massimo Liquori, Andrea Scozzari
openaire +1 more source
On the Incompressibility of Monotone DNFs
Theory of Computing Systems, 2005We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these circuits need exactly as many OR gates as the respective DNFs. The proofs exploit a property of the functions that is based solely on prime implicant structure.
openaire +1 more source
DNF Hypotheses in Explanatory Induction
2012This paper investigates the problem of computing hypotheses in disjunctive normal form (DNF) for explanatory induction. This is contrasted to the usual setting of ILP, where hypotheses are obtained in conjunctive normal form (CNF), i.e., a set of clauses.
openaire +1 more source
Secure Multiparty Computation of DNF
2007Homomorphism based multiparty computation techniques are studied in this paper as they have several advantages over the other multiparty computation schemes. A new homomorphism based multiparty computation technique is proposed to evaluate functions in DNF form.
openaire +1 more source