Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
نویسندگان
چکیده
The paper is an exercise in formal program development. We rigorously show how planning problems encoded as entailment problems in the uent calculus can be mapped onto satissability problems for propositional formulas, which in turn can be mapped to the problem to nd models using binary decision diagrams. The mapping is shown to be sound and complete. Preliminary experimental results of an implementation are discussed.
منابع مشابه
Planning in the Fluent Calculus Using Binary Decision Diagrams
As a part of my group’s activities on the extension of the fluent calculus (Hölldobler and Schneeberger 1990; Thielscher 1998), I’ve been working to provide an efficient inference engine for the fluent calculus by using the efficiency of binary decision diagrams (BDDs) (Bryant 1986). In the past, BDDs have significantly improved the performance of algorithms and enabled the solution of new clas...
متن کاملBDD-based reasoning in the fluent calculus - first results
The paper reports on first preliminary results and insights gained in a project aiming at implementing the fluent calculus using methods and techniques based on binary decision diagrams. After reporting on an initial experiment showing promising results we discuss our findings concerning various techniques and heuristics used to speed up the reasoning process.
متن کاملSymbolic Dynamic Programming
A symbolic dynamic programming approach for solving first-order Markov decision processes within the situation calculus is presented. As an alternative specification language for dynamic worlds the fluent calculus is chosen and the fluent calculus formalization of the symbolic dynamic programming approach is provided. The major constructs of Markov decision processes such as the optimal value f...
متن کاملCombinational Logic-Level Veri cation using Boolean Expression Diagrams
Boolean Expression Diagrams (BEDs) is a new data structure for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) that are capable of representing any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level ve...
متن کاملBinary Decision Diagrams
A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table requires space Ω(2n) to represent. In this lecture we introduce a data structure called a binary decision diagram which gives a representation that is potentially much more compact. We furthermore show how binary decision diagrams can be used to decide satisfia...
متن کامل