881 search results - page 101 / 177 » Solving satisfiability problems with preferences |
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...