Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Stochastic nets and performance evaluation
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Theoretical Computer Science
Petri nets as models of linear logic
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
ACM SIGACT News
Generating plans in linear logic I: actions as proofs
Theoretical Computer Science
Normal and sinkless Petri nets
Journal of Computer and System Sciences
Fast planning through planning graph analysis
Artificial Intelligence
ACM Computing Surveys (CSUR)
Petri Nets, Horn Programs, Linear Logic, and Vector Games
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Deductive Synthesis of Recursive Plans in Linear Logic
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
On assembly sequence planning using Petri nets
ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
Hi-index | 0.00 |
The aim of this work is to develop a resource-conscious Artificial Intelligence (AI) planning system, which allows for nondeterminism in the environment. Such planner has a potential in applications where actions in "real world" are considered.The planning process is based on proof search for a fragment of Linear Logic (LL) [10] sequents using a subset of LL rules. As LL is resource-conscious and has additive disjunction connective (represents nondeterminism), LL sequents are used to describe an application domain, whereby every LL sequent represents pre- and postconditions of a particular action execution.We present an idea to use Petri net reachability tree analysis for finding proofs for propositional LL sequents. Game playing is used to solve LL additive disjunctions. From LL proofs plans are extracted which because of underlying LL properties keep track of resources and handle both deterministic and nondeterministic actions.