A Deductive Database Approach to A.I. Planning

  • Authors:

  • Antonio Brogi;V. S. Subrahmanian;Carlo Zaniolo

  • Affiliations:

  • Dipartimento di Informatica, Università di Pisa Corso Italia 40, 56125 Pisa, Italy. brogi@di.unipi.it;Computer Science Department, University of Maryland College Park, MD 20742, USA. vs@cs.umd.edu;Computer Science Department, University of California, Los Angeles CA 90025, USA. zaniolo@cs.ucla.edu

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we show that the classical A.I. planning problem can be modelled using simple database constructs with logic-based semantics. The approach is similar to that used to model updates and nondeterminism in active database rules. We begin by showing that planning problems can be automatically converted to Datalog1S programs with nondeterministic choice constructs, for which we provide a formal semantics using the concept of stable models. The resulting programs are characterized by a syntactic structure (XY-stratification) that makes them amenable to efficient implementation using compilation and fixpoint computation techniques developed for deductive database systems. We first develop the approach for sequential plans, and then we illustrate its flexibility and expressiveness by formalizing a model for parallel plans, where several actions can be executed simultaneously. The characterization of parallel plans as partially ordered plans allows us to develop (parallel) versions of partially ordered plans that can often be executed faster than the original partially ordered plans.