Refining and Extending the Procedural Net
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 1010-1011.
Abstract
This paper presents a new definition for Plans. The objects defined are called Plan Nets, and are similar in spirit to Sacerdoti's Procedural Nets (1975) . It is argued that Plan Nets are more descriptive than Procedural Nets, because they can easily describe iterative behaviour . The Plan Net definition is motivated by providing an operational s emanlies for the Procedural Net, and noticing that all Procedural Net state spaces are "loop free". This is seen to restriet the behaviours that can be described by the Procedural Net to those which do not include iteration. It is suggested that Plan Net state spaces can contain loops, and thus can describe iterative behaviour .
@inproceedings{ijcai1985p202,
title = {Refining and Extending the Procedural Net},
author = {Drummond, Mark},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {1010--1011},
year = {1985},
note = {Planning and Search},
url = {https://ijcai.org/proceedings/1985/202},
}
TY - CPAPER TI - Refining and Extending the Procedural Net AU - Drummond, Mark T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 1010 EP - 1011 UR - https://ijcai.org/proceedings/1985/202 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
