2864 search results - page 341 / 573 » Constraint Programming in OPL |
WWW
2006
ACM
14 years 10 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
CP
2009
Springer
14 years 10 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
CP
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
TACAS
2010
Springer
14 years 4 months ago
2010
Springer
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
CP
2009
Springer
14 years 4 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...