Event calculus planning through satisfiability

  • Shanahan M
  • Witkowski M
  • 8


    Mendeley users who have this article in their library.
  • 22


    Citations of this article.


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.

Author-supplied keywords

  • Event calculus
  • Satisfiability planning

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Murray Shanahan

  • Mark Witkowski

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free