Abstract
In this paper the classical planning problem is formalized as a Petri Net. The authors review the Graphplan notions of mutex relation and maintenance actions based on the Petri Net flow. They also classify pairs of conflicting actions in terms of four different control structures, which are used to build the Plan Net. In addition the authors present the order relation of propositions, i.e., pairs of conflicting propositions that allow inclusion of more information in the Planning Net. The planning problem represented on Planning Net is translated into a SAT instance and solved by a modern SAT solver. The authors show the advantages provided by the inclusion of the propositions ordering relation and compare their experimental results with Satplan.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Natural Computing Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
