Sciweavers

1264 search results - page 40 / 253
» The framework approach for constraint satisfaction
Sort
View
CSCLP
2007
Springer
16 years 8 days ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
ECP
1997
Springer
88views Robotics» more  ECP 1997»
15 years 10 months ago
A Time and Resource Problem for Planning Architectures
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
Amedeo Cesta, Cristiano Stella
ACL
1997
15 years 7 months ago
A Uniform Approach to Underspecification and Parallelism
We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
AI
2003
Springer
15 years 11 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
CP
2008
Springer
15 years 7 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang