138 search results - page 23 / 28 » Domain Transmutation in Constraint Satisfaction Problems |
98
Voted
CORR
1998
Springer
14 years 9 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
CP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
85
Voted
FLAIRS
2004
14 years 11 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
91
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
IJSN
2006
14 years 9 months ago
2006
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...