248 search results - page 36 / 50 » Circuit-based Boolean Reasoning |
SAT
2005
Springer
14 years 2 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
FLOPS
2004
Springer
14 years 2 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
SAS
1997
Springer
14 years 1 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
SAT
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....