ECAI
2006
Springer
15 years 6 months ago
2006
Springer
109
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
103
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
110
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...