6456 search results - page 54 / 1292 » Constraint Solving on Terms |
93
Voted
JCSS
2010
14 years 11 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
101
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
139
click to vote
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
84
Voted
AAAI
2006
15 years 2 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...