Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A new deductive approach to planning
New Generation Computing
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Fast planning through planning graph analysis
Artificial Intelligence
Proceedings of the NATO Advanced Study Institute on Deductive program design
Reasoning about actions: steady versus stabilizing state constraints
Artificial Intelligence
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A New Equational Foundation for the Fluent Calculus
CL '00 Proceedings of the First International Conference on Computational Logic
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A New Equational Foundation for the Fluent Calculus
CL '00 Proceedings of the First International Conference on Computational Logic
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
It is rigorously shown how planning problems encoded as a class of entailment problems in the fluent calculus can be mapped onto satisfiability problems for propositional formulas, which in turn can be mapped to the problem of finding models using binary decision diagrams (BDDs). The mapping is shown to be sound and complete. First experimental results of an implementation are presented and discussed.