Compact Tree Encodings for Planning as QBF

  • Olivier Gasquet IRIT-University Toulouse 3
  • Dominique Longin
  • Fr´ed´eric Maris
  • Pierre R´egnier
  • Ma¨el Valais
Keywords: Planning, Quantified Boolean Formula, Encodings


Considerable improvements in the technology and performance of SAT solvers has made their use possible for the resolution of various problems in artificial intelligence, and among them that of generating plans. Recently, promising Quantified Boolean Formula (QBF) solvers have been developed and we may expect that in a near future they become as efficient as SAT solvers. So, it is interesting to use QBF language that allows us to produce more compact encodings. We present in this article a translation from STRIPS planning problems into quantified propositional formulas. We introduce two new Compact Tree Encodings: CTE-EFA based on Explanatory frame axioms, and CTE-OPEN based on causal links. Then we compare both of them to CTE-NOOP based on No-op Actions proposed in [Cashmore et al. 2012]. In terms of execution time over benchmark problems, CTE-EFA and CTE-OPEN always performed better than CTE-NOOP.


Download data is not yet available.
How to Cite
Gasquet, O., Longin, D., Maris, F., R´egnierP., & Valais, M. (2018). Compact Tree Encodings for Planning as QBF. Inteligencia Artificial, 21(62), 103-113.