Abstract
The paper discusses the role of iteration in robot plans constructed in the framework of predicate logic. It is shown that, unless some special axioms are added, the class of solvable tasks is not enlarged by admitting iteration in plans.
Get full access to this article
View all access options for this article.
