1278 search results - page 28 / 256 » The Complexity of Weighted Boolean |
UAI
2004
13 years 9 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
RELMICS
1998
Springer
13 years 12 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
BIOINFORMATICS
2006
13 years 7 months ago
2006
Motivation: Intervention in a gene regulatory network is used to avoid undesirable states, such as those associated with a disease. Several types of intervention have been studied...
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...