283 search results - page 11 / 57 » Solving Over-Constrained Problems with SAT |
CAV
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
ISMVL
2007
IEEE
14 years 2 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
ACTA
2006
13 years 8 months ago
2006
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
TPLP
2008
13 years 7 months ago
2008
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
PRICAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...