PROMAL: Programming in Modal Action Logic

In this work we present PROMAL: Programming in Modal Action Logic, a formalism to deal with the planning problem. This formalism is based on the concepts of Modal Action Logic (MAL) and may be regarded as an extension of SLD-Resolution to allow the clauses of a Definite Set to have literals with modalities.

[1]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[2]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[3]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[4]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.