Skip to main content

PROMAL: Programming in modal action logic

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (SBIA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 991))

Included in the following conference series:

  • 134 Accesses

Abstract

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.

The modalities are intended to capture the notion of state change caused by the execution of actions. As in previous works in MAL, we call the information about a system's state scenario. Besides accomplishing proofs of properties of specific scenarios it is possible to search scenarios where desired properties hold.

An earlier version of this paper was published in the IX Brazilian Conference on Artificial Intelligence (SBIA'92) — In Portuguese. This is an extension and formalisation of that work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Colmerauer, H. Kanoui, P. Roussel, and R. Pasero. Un système de communication homme-machine en français. Technical report, Université d'Aix-Marseille, 1973. Groupe de Recherche en Intelligence Artificielle.

    Google Scholar 

  2. L. Fariñas del Cerro. Molog: A system that extends prolog with modal logic. New Generation Computing, 4:35–50, 1986.

    Google Scholar 

  3. R. E. Fikes and N. J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. In Proceedings of 2 nd IJCAI, Imperial College, London, England, 1971.

    Google Scholar 

  4. R. Goldblatt. Axiomatizing the Logic of Computer Programming. Lecture Notes in Computer Science. Springer-Verlag, New York, Heidelberg, Berlin, 1982.

    Google Scholar 

  5. D. Harel. First Order Dynamic Logic, volume 68 of Lectures Notes in Computer Science. Springer-Verlag, 1979.

    Google Scholar 

  6. R. A. Kowalski. Predicate logic as a programming language. In IFIP-74, pages 569–574, 1974.

    Google Scholar 

  7. J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, 1984.

    Google Scholar 

  8. T.S.E. Maibaum. A logic for the formal requirements specification of real-time / embedded systems. Technical report, Dept. of Computing, Imperial College, London, 1987.

    Google Scholar 

  9. Odinaldo Teixeira Rodrigues. Prolog modal de ação e revisāo de crenças em conjuntos definidos. Master's thesis, COPPE — Universidade Federal do Rio de Janeiro-Brazil, 1993. In Portuguese.

    Google Scholar 

  10. David H. D. Warren. A system for generating plans. Technical report, Department of Artificial Intelligence, Edinburgh University, June 1974. Memo 76.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Wainer Ariadne Carvalho

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodrigues, O., Benevides, M. (1995). PROMAL: Programming in modal action logic. In: Wainer, J., Carvalho, A. (eds) Advances in Artificial Intelligence. SBIA 1995. Lecture Notes in Computer Science, vol 991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034803

Download citation

  • DOI: https://doi.org/10.1007/BFb0034803

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60436-5

  • Online ISBN: 978-3-540-47467-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics