634 search results - page 4 / 127 » Completion Procedures as Semidecision Procedures |
CADE
2012
Springer
11 years 9 months ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
CP
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
LATIN
2004
Springer
14 years 21 days ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
EVOW
2011
Springer
12 years 10 months ago
2011
Springer
The Strategy Game Description Game Language (SGDL) is intended to become a complete description of all aspects of strategy games, including rules, parameters, scenarios, maps, and ...