193 search results - page 17 / 39 » sat 2007 |
DAGSTUHL
2007
14 years 11 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
CADE
2007
Springer
15 years 9 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
ICTAI
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
IJCAI
2007
14 years 11 months ago
2007
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
109
click to vote
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
We offer a transition system representing a high-level but detailed architecture for SMT solvers that combine a propositional SAT engine with solvers for multiple disjoint theorie...