4117 search results - page 304 / 824 » On the Satisfiability of Complex Constraints |
168
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
177
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
208
click to vote
BIRTHDAY
2003
Springer
16 years 1 days ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
174
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...