503 search results - page 33 / 101 » Interpolative Boolean Logic |
104
Voted
JACM
2002
15 years 22 days ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
101
Voted
FPGA
2007
ACM
15 years 7 months ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
115
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
127
Voted
CADE
2005
Springer
16 years 1 months ago
2005
Springer
We present a combination method for generating interpolants for a class of first-order theories. Using interpolant-generation procedures for individual theories as black-boxes, our...
96
Voted
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...