首页    期刊浏览 2024年10月05日 星期六
登录注册

文章基本信息

  • 标题:Compact Tree Encodings for Planning as QBF
  • 本地全文:下载
  • 作者:Olivier Gasquet ; Dominique Longin ; Fr´ed´eric Maris
  • 期刊名称:Inteligencia Artificial : Ibero-American Journal of Artificial Intelligence
  • 印刷版ISSN:1137-3601
  • 电子版ISSN:1988-3064
  • 出版年度:2018
  • 卷号:21
  • 期号:62
  • 页码:103-113
  • DOI:10.4114/intartif.vol21iss62pp103-113
  • 语种:English
  • 出版社:Spanish Association for Intelligence Artificial
  • 摘要: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.
  • 其他摘要: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.
国家哲学社会科学文献中心版权所有