Planning in the Fluent Calculus Using Binary Decision Diagrams

Abstract

BDDplan was created to perform certain reasoning processes in the fluent calculus, a flexible framework for reasoning about action and change based on first-order logic with equality (plus some second-order extensions in some cases). The reasoning is done by mapping the problems into propositional logic, which, in turn, can be implemented as operations on binary decision diagrams (BDDs).