Sciweavers

711 search results - page 5 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
IJCAI
1993
13 years 8 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
LICS
2012
IEEE
11 years 9 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
CONSTRAINTS
2006
76views more  CONSTRAINTS 2006»
13 years 7 months ago
Symmetry Definitions for Constraint Satisfaction Problems
We review the many different definitions of symmetry for constraint satisfaction problems (CSPs) that have appeared in the literature, and show that a symmetry can be defined in tw...
David A. Cohen, Peter Jeavons, Christopher Jeffers...
FLAIRS
2008
13 years 9 months ago
Reformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
Roman Barták, Daniel Toropila
GI
2009
Springer
13 years 11 months ago
Constraint Checking for Business Process Management
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
Wolfgang Runte, Marwane El Kharbili