4 search results - page 1 / 1 » SAT-Based Decision Procedures for Automated Reasoning: A Uni... |
152
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
117
click to vote
CL
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
148
click to vote
CADE
2004
Springer
16 years 3 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
153
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...