Event Calculus Planning Through Satisfiability

Authors:
Murray Shanahan;Mark Witkowski
Affiliations:
Department of Electrical and Electronic Engineering, Imperial College, Exhibition Road, London SW7 2BT, UK. E-mail: m.shanahan@imperial.ac.uk, m.witkowski@imperial.ac.uk;Department of Electrical and Electronic Engineering, Imperial College, Exhibition Road, London SW7 2BT, UK. E-mail: m.shanahan@imperial.ac.uk, m.witkowski@imperial.ac.uk
Venue:
Journal of Logic and Computation
Year:
2004

Citing 0
Cited 12

Reinventing shakey

Logic-based artificial intelligence
Story understanding through multi-representation model construction

HLT-NAACL-TEXTMEANING '03 Proceedings of the HLT-NAACL 2003 workshop on Text meaning - Volume 9
Specifying norm-governed computational societies

ACM Transactions on Computational Logic (TOCL)
Circumscriptive event calculus as answer set programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Competence checking for the global e-service society using games

ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII
Modular-E and the role of elaboration tolerance in solving the qualification problem

Artificial Intelligence
Modular-ε: an elaboration tolerant approach to the ramification and qualification problems

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Towards formal verification of web service composition

BPM'06 Proceedings of the 4th international conference on Business Process Management
Web service mining and verification of properties: an approach based on event calculus

ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Understanding script-based stories using commonsense reasoning

Cognitive Systems Research
Integrating relational reinforcement learning with reasoning about actions and change

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.