首页> 外文期刊>Journal of logic and computation >Event Calculus Planning Through Satisfiability
【24h】

Event Calculus Planning Through Satisfiability

机译:通过满意度进行事件演算计划

获取原文
获取原文并翻译 | 示例
           

摘要

Previous work on event calculus planning has viewed it as an abductive task, whose implementation through abductive logic programming reduces to partial order planning. By contrast, this paper presents a formal framework for tackling event calculus planning through satisfiability, in the style of Kautz and Selman. A provably correct conjunctive normal form encoding for event calculus planning problems is supplied, rendering them soluble by an off-the-shelf SAT solver.
机译:以前有关事件演算计划的工作将其视为绑架任务,通过绑架逻辑编程将其实现简化为部分订单计划。相比之下,本文以考茨(Kautz)和塞尔曼(Selman)的风格,提出了一种通过可满足性解决事件演算计划的正式框架。提供了一种针对事件演算计划问题的经证明正确的合取范式编码,可通过现成的SAT解算器将其分解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号