Reachability, Relevance, Resolution and the Planning as Satisfiability Approach
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Planning and Scheduling. Pages 976-980.
Abstract
We investigate the ability of two central encoding methods to propagate reachability and relevance information using resolution steps. More specifically, we compare the ability of unit-propagation and higher-order resolution steps to propagate reachability and relevance information in the context of the linear and GRAPHPLAN encoding schemes to the ability of a natural class of reachability and relevance algorithms that operate at the plan level. As a result of our observations and additional considerations, we experiment with a preprocessing step based on limited binary resolution that shows nice results.
@inproceedings{ijcai1999p139,
title = {Reachability, Relevance, Resolution and the Planning as Satisfiability Approach},
author = {Brafman, Ronen I.},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {976--980},
year = {1999},
note = {Planning and Scheduling},
url = {https://ijcai.org/proceedings/1999/139},
}
TY - CPAPER TI - Reachability, Relevance, Resolution and the Planning as Satisfiability Approach AU - Brafman, Ronen I. T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 976 EP - 980 UR - https://ijcai.org/proceedings/1999/139 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
