248 search results - page 8 / 50 » Circuit-based Boolean Reasoning |
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
IGPL
2008
13 years 8 months ago
2008
A critical view of the alleged significance of Belnap four-valued logic for reasoning under inconsistent and incomplete information is provided. The difficulty lies in the confusi...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In [6] J. Laird has shown that an infinitary sequential extenPCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper ...
TCAD
2008
13 years 7 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...