248 search results - page 11 / 50 » Circuit-based Boolean Reasoning |
LICS
1998
IEEE
15 years 6 months ago
1998
IEEE
In his well-known paper \How computer should think" ( Be77b]) Belnap argues that four-valued semantics is a very suitable setting for computerized reasoning. In this paper we...
116
click to vote
LPAR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
127
Voted
DAGSTUHL
2006
15 years 3 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
108
click to vote
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
138
Voted
AMAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...