1021 search results - page 19 / 205 » Concepts in Proof Planning |
AAAI
2010
13 years 8 months ago
2010
An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots ...
JAMDS
2002
13 years 8 months ago
2002
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
ARGMAS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between b...
PRICAI
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...