Planning in the Fluent Calculus Using Binary Decision Diagrams
暂无分享,去创建一个
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).
[1] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[2] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[3] Steffen Hölldobler,et al. Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams , 2000, Computational Logic.