Planning problems in Petri Nets and Fluent Calculus

From International Center for Computational Logic
Toggle side column

Planning problems in Petri Nets and Fluent Calculus

Master's thesis by Ferdian Jovan
In this thesis we discuss conjunctive planning problems in the context of the fluent

calculus and Petri nets. We show that both formalisms are equivalent in solving these problems. Thereafter, we extend actions to contain preconditions as well as obstacles. This requires to extend the fluent calculus as well as Petri nets. Again, we show that both extended formalisms are equivalent. Inspired from Petri nets, we add real-valued information to conjunctive planning problems. We show that the fluent calculus is capable in solving conjunctive planning problems with real-valued information.
Keyword: Petri nets, fluent calculus, equational logic programming, conjunctive planning problems