503 search results - page 96 / 101 » Interpolative Boolean Logic |
CIE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
ASYNC
2000
IEEE
14 years 3 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
ATVA
2008
Springer
14 years 26 days ago
2008
Springer
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
AIML
2004
14 years 8 days ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
BMCBI
2004
13 years 10 months ago
2004
Background: Recent technological advances in high-throughput data collection allow for experimental study of increasingly complex systems on the scale of the whole cellular genome...