4513 search results - page 527 / 903 » Logic programming with satisfiability |
135
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
120
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
145
Voted
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
145
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Several current research efforts in business process modeling are investigating XML-based executable formal specification languages. The availability of the latter allows modeled...
132
click to vote
CSL
2007
Springer
15 years 11 months ago
2007
Springer
Automata on infinite objects were the key to the solution of several fundamental decision problems in mathematics and logic. Today, automata on infinite objects are used for form...