Dominance and Subsumption in Constraint-Posting Planning
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 884-889.
Abstract
By integrating a dominance prover into the plan search process, the traditional constraint-posting planning paradigm can be generalized to permit partially satisfiable goals. In this approach, the view of planning as theorem proving is retained, although the emphasis is on proving theorems about dominance relations on classes of candidate plans. Plan classes are generated by posting constraints at various levels of abstraction, then classified within a plan lattice that · manages inheritance of properties and dominance characteristics. An analysis of TWEAK demonstrates how to recast existing planning ideas in this framework, providing insight into the planner's capabilities with a dominance-proving interpretation. The plan lattice representation highlights the role of plan subsumption in optimizing search.
@inproceedings{ijcai1987p184,
title = {Dominance and Subsumption in Constraint-Posting Planning},
author = {Wellman, Michael P.},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {884--889},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/184},
}
TY - CPAPER TI - Dominance and Subsumption in Constraint-Posting Planning AU - Wellman, Michael P. T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 884 EP - 889 UR - https://ijcai.org/proceedings/1987/184 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
