4451 search results - page 24 / 891 » On Random Ordering Constraints |
180
click to vote
TLCA
2007
Springer
16 years 19 hour ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
180
click to vote
SARA
2009
Springer
16 years 13 days ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
191
click to vote
BIRTHDAY
2007
Springer
16 years 3 days ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
175
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...