No full-text available
To read the full-text of this research,
you can request a copy directly from the author.
Nonmonotonic Entailment for Reasoning about Time and Action, Part II: Concurrent Actions
... Unfortunately, most temporal logics use some kind of non-monotonic reasoning to reason about change, thus making them undecidable. An implementation of a restricted version of one such logic, ETL (Sandewall, 1988b; Sandewall, 1988c; Sandewall, 1988d; Sandewall, 1989), is re-ported by Hansson (1990). His decision procedure solves temporal projection in exponential time, but is not guaranteed to terminate for planning. ...
This article describes a polynomial-time, O(n3), planning algorithm for a limited class of planning problems. Compared to previous work on complexity of algorithms for knowledge-based or logic-based planning, our algorithm achieves computational tractability, but at the expense of only applying to a significantly more limited class of problems. Our algorithm is proven correct, and it always returns a parallel minimal plan if there is a plan at all.
Cet article décrit un algorithme de planification de temps polynomial O(n3) pour une classe restreinte de problemes de planification. Contrairement aux travaux précédents sur la complexité des algorithmes pour la planification basée sur la logique ou les connaissances, l' algorithme dont il est question dans cet article permet d' obtenir la tractabilityé computationnelle; cependant, il ne peut ětre appliqué qu'à une catégorie beaucoup plus restreinte de problèmes. Cet algorithme s'est done révélé correct et il génère toujours un plan minimal en parallèle lorsqu'il y en a un.
ResearchGate has not been able to resolve any references for this publication.