4117 search results - page 169 / 824 » On the Satisfiability of Complex Constraints |
192
click to vote
CADE
2002
Springer
16 years 6 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 ...
175
click to vote
DFT
2006
IEEE
16 years 18 days ago
2006
IEEE
This paper presents a procedure for Synthesis of LINear test pattern Generators called SLING. SLING can synthesize linear test pattern generators that satisfy constraints on area,...
151
click to vote
AAAI
1998
15 years 8 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
177
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
179
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...