M. Birna van Riemsdijk
ABSTRACT
This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. We argue that Maude is very well suited for prototyping agent programming languages such as 3APL.
- J. V. Baalen, J. L. Caldwell, and S. Mishra. Specifying and checking fault-tolerant agent-based protocols using Maude. In FAABS '00: Proc. of the First Int. Workshop on Formal Approaches to Agent-Based Systems-Revised Papers, volume 1871 of LNCS, London, UK, 2001. Springer-Verlag.]] Google Scholar
Digital Library
- R. H. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni. Multi-Agent Programming: Languages, Platforms and Applications. Springer, Berlin, 2005.]]Google ScholarDigital Library
- R. H. Bordini, M. Fisher, C. Pardavila, and M. Wooldridge. Model checking AgentSpeak. In Proc. of AAMAS'03, 2003.]] Google ScholarDigital Library
- R. H. Bordini and A. F. Moreira. Proving the asymmetry thesis principles for a BDI agent-oriented programming language. Electronic Notes in Theoretical Computer Science, 70(5), 2002.]]Google Scholar
- N. Boudiaf, F. Mokhati, M. Badri, and L. Badri. Specifying DIMA multi-agent models using Maude. In Proc. of PRIMA'04, volume 3371 of LNCS. Springer, 2005.]] Google ScholarDigital Library
- M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude manual (version 2.1.1). 2005.]]Google Scholar
- M. Clavel and J. Meseguer. Reflection and strategies in rewriting logic. Electronic Notes in Theoretical Computer Science, 4:125--147, 1996.]]Google Scholar
- M. Dastani, F. S. de Boer, F. Dignum, and J.-J. Ch. Meyer. Programming agent deliberation - an approach illustrated using the 3APL language. In Proc. of AAMAS'03, 2003.]] Google ScholarDigital Library
- M. Dastani, M. B. van Riemsdijk, F. Dignum, and J.-J. Ch. Meyer. A programming language for cognitive agents: goal directed 3APL. In Programming multiagent systems, first int. workshop (ProMAS'03), volume 3067 of LNAI. Springer, Berlin, 2004.]]Google Scholar
- M. Dastani, M. B. van Riemsdijk, and J.-J. Ch. Meyer. Programming multi-agent systems in 3APL. In R. H. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors, Multi-Agent Programming: Languages, Platforms and Applications. Springer, Berlin, 2005.]]Google Scholar
- F. Durán, S. Eker, P. Lincoln, and J. Meseguer. Principles of mobile Maude. In Proc. of the Second Int. Symposium on Agent Systems and Applications and Fourth Int. Symposium on Mobile Agents, volume 1882 of LNCS, 2000. Springer-Verlag.]] Google ScholarDigital Library
- S. Eker, J. Meseguer, and A. Sridharanarayanan. The Maude LTL model checker. In F. Gaducci and U. Montanari, editors, Proc. of the 4th Int. Workshop on Rewriting Logic and Its Applications (WRLA 2002), volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002.]]Google Scholar
- K. V. Hindriks, F. S. de Boer, W. van der Hoek, and J.-J. Ch. Meyer. Agent programming in 3APL. Int. J. of AAMAS, 2(4):357--401, 1999.]] Google ScholarDigital Library
- G. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, New Jersey, 1991.]] Google ScholarDigital Library
- G. Holzmann. The model checker SPIN. IEEE Trans. Software Engineering, 23(5):279--295, 1997.]] Google ScholarDigital Library
- M. Kulas and C. Beierle. Defining standard Prolog in rewriting logic. In Electronic Notes in Theoretical Computer Science, volume 36. Elsevier Science Publishers, 2000.]]Google Scholar
- N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. In J. Meseguer, editor, Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Science Publishers, 2000.]]Google Scholar
- J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73--155, 1992.]] Google ScholarDigital Library
- J. Meseguer. Membership algebra as a logical framework for equational specification. In Proc. of the 12th Int. Workshop on Recent Trends in Algebraic Development Techniques, 1997. Springer-Verlag.]] Google ScholarDigital Library
- P. C. Ölveczky. Formal modeling and analysis of distributed systems in Maude. Lecture Notes, 2005.]]Google Scholar
- G. D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus, 1981.]]Google Scholar
- A. Pokahr, L. Braubach, and W. Lamersdorf. Jadex: a BDI reasoning engine. In R. H. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors, Multi-Agent Programming: Languages, Platforms and Applications. Springer, Berlin, 2005.]]Google Scholar
- M. B. van Riemsdijk, M. Dastani, and J.-J. Ch. Meyer. Semantics of declarative goals in agent programming. In Proc. of AAMAS'05, 2005.]] Google ScholarDigital Library
- M. B. van Riemsdijk, J.-J. Ch. Meyer, and F. S. de Boer. Semantics of plan revision in intelligent agents. In C. Rattray, S. Maharaj, and C. Shankland, editors, Theoretical Computer Science, pages 240--257. 2006. Special issue of Algebraic Methodology and Software Technology (AMAST'04).]] Google ScholarDigital Library
- M. B. van Riemsdijk, W. van der Hoek, and J.-J. Ch. Meyer. Agent programming in Dribble: from beliefs to goals using plans. In Proc. of AAMAS'03, 2003.]] Google ScholarDigital Library
- A. Verdejo and N. Martí-Oliet. Executable structural operational semantics in Maude. Technical report, Universidad Complutense de Madrid, Madrid, 2003.]]Google Scholar
- M. Wirsing. Algebraic specification. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam, 1990.]] Google ScholarDigital Library
Index Terms
- Prototyping 3APL in the Maude term rewriting language
Recommendations
Prototyping 3APL in the Maude term rewriting language
CLIMA VII'06: Proceedings of the 7th international conference on Computational logic in multi-agent systemsThis paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on the mathematical theory of rewriting logic. The language has been shown to be ...
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem with several applications in the fields of term rewriting and programming ...
Automated termination proofs for haskell by term rewriting
There are many powerful techniques for automated termination analysis of term rewriting. However, up to now they have hardly been used for real programming languages. We present a new approach which permits the application of existing techniques from ...
Comments