503 search results - page 35 / 101 » Interpolative Boolean Logic |
120
click to vote
TCAD
2002
15 years 19 days ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
104
Voted
ICTAI
2008
IEEE
15 years 7 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
101
click to vote
CADE
2002
Springer
16 years 1 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
132
click to vote
AB
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...
DAC
2005
ACM
15 years 3 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...