2 search results - page 1 / 1 » Comparing CSP and SAT Solvers for Polynomial Constraints in ... |
ENTCS
2008
13 years 4 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...