Constraints from STRIPS — Preliminary Report

We re-visit the problem of converting action specifications into system constraints by re-examining it in the very simple setting of STRIPS. This has the merit of making many thorny issues relatively transparent. The paper is in the form of an extended summary of ongoing work and many of the results are merely outlined. But sufficient details are included to indicate where we will be taking things further, and to encourage others to pursue the same objectives. These objectives are in some sense a kind of reverse-engineering, as the database community is evidently familiar with the idea of starting with constraints and then deriving action specifications from them. However in AI reactive systems, action specifications are often the primary entity, so techniques to unearth the implicit constraints can facilitate better designs.

Authors and Affiliations

1. NICTA, and The School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, 2052, Australia

   Norman Foo

2. Dept of Business Administration, University of Patras, 26110, Patras, Greece

   Pavlos Peppas

3. School of Computing and Information Technology, University of Western Sydney, NSW, 2747, Australia

   Yan Zhang

Editors and Affiliations

1. Faculty of Information Technology, Monash University, VIC 3800, Australia

   Geoffrey I. Webb

2. Science, Engineering and Technology Portfolio, Royal Melbourne Institute of Technology, VIC 3001, Melbourne, Australia

   Xinghuo Yu

Reprints and permissions

© 2004 Springer-Verlag Berlin Heidelberg

Policies and ethics