4117 search results - page 75 / 824 » On the Satisfiability of Complex Constraints |
162
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
162
click to vote
AICCSA
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
158
click to vote
WADS
2007
Springer
16 years 13 days ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
168
click to vote
JAIR
2011
15 years 1 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...