283 search results - page 28 / 57 » Solving Over-Constrained Problems with SAT |
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
ENTCS
2008
13 years 8 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...
SAT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
IJCAI
2007
13 years 9 months ago
2007
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, wh...
AIPS
2000
13 years 9 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...