283 search results - page 31 / 57 » Solving Over-Constrained Problems with SAT |
CP
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
AIPS
2006
13 years 10 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
AMAI
2005
Springer
13 years 9 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
TACAS
2010
Springer
14 years 4 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...