Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A formal semantics for DAI language NUML

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Traditional AI systems are brittle in the sense that they fail miserably when presented with problems even slightly outside of their limited range of expertise. A powerful, extensible strategy of Distributed Artificial Intelligence (DAI) for overcoming such bounds is to put the system in a society of systems. So the ability to coordinate group activities of individuals and to communicate between each other is necessary for a language describing DAI systems. Agent-oriented language NUML is such a language. It is a specific kind of object-oriented language. To give formal semantics to NUML, there is the problem to formalise object-oriented programming paradigm which is still open. The theory of higher-order π-calculus is a concurrent computation model with sufficient capability, which provides us a mathematical tool to do the formalization. This paper tries to use higher-order π-calculus to formalise NUML.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Durfee E H. The distributed artificial intelligence melting pot.IEEE Trans. on System, Man, and Cybernetics, 1991, 21(6): 1301–1306.

    Article  Google Scholar 

  2. Shoham Y. Agent-oriented programming.Artificial Intelligence, 1993, 60(1): 51–92.

    Article  MathSciNet  Google Scholar 

  3. Genesereth M R, Nilsson N J. Logical foundations of artificial intelligence. Morgan Kaufmann Publisher Inc. (USA), 1987.

    MATH  Google Scholar 

  4. Xu Manwu. An Implementation of pure Horn-clause logic programming in a reduction system.J. of Computer Science & Technology, 1993, 8(3): 243–251.

    Article  Google Scholar 

  5. Xu Manwu, Liu Fengyu. A reduction machine model RMND for implementing knowledge inference representation language MLND.Chinese Journal of Computers, 1992, 15(5): 356–363.

    MathSciNet  Google Scholar 

  6. Milner R. The Polyadic π-calculus: a tutorial. Reports ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1991.

  7. Milner R, Parrow J, Walker D. A calculus of mobile processes (I), (II).Information and Computation, 1992, 100(1): 1–77.

    Article  MATH  MathSciNet  Google Scholar 

  8. Walker D. Objects in the π-calculus. Research Report 217, Department of Computer Science, University of Warwick, 1992.

  9. Thosem B. Plain CHOCS: a second generation calculus for higher-order processes.Acta Informatica, 1993, 30(1): 1–59.

    Article  MathSciNet  Google Scholar 

  10. Davide Sangiorgi. Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. thesis, University of Edinburgh, 1992.

  11. Lloyd J W. Foundations of logic programming. Springer-Verlag, 1984.

  12. Barendregt H P. Lambda calculi with types. InHandbook of logic in computer science, Abramsky S, Gabbai D M, Maibaum T S E (eds.), Oxford University Press, 1992.

  13. Nordström B, Petersson K, Smith J M. Programming in Martin-löf's type theory: an introduction. Oxford University Press, 1990.

  14. Berry G, Boudol G. The chemical abstract machine.Theoretical Computer Science, 1992, 96(2): 217–248.

    Article  MATH  MathSciNet  Google Scholar 

  15. Milner R. Elements of interaction.CACM, 1993, 36(1): 78–89.

    Google Scholar 

  16. Seckmann J H. Unification theory.J. of Symbolic Computation, 1989, 7(3–4): 207–274.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Technology, Nanjing University, 210093, Nanjing

    Xu Manwu, Lu Jianfeng, Zeng Fancong & Dai Jinwen

Authors
  1. Xu Manwu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Lu Jianfeng
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Zeng Fancong
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Dai Jinwen
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This project is supported by the National High-tech. Research & Development Program(863), National Natural Science Foundation and National Key Laboratory of Software Engineering of China.

Xu Manwu completed his undergraduate and graduate study in mathematics in 1965 and 1968 in Nanjing University. He received his M.S. and Ph.D. degrees in computer science in 1981 and 1984, respectively, from nanjing University.

During 1968 to 1978, he was a research scientist in East China Automation Institute. In 1984, he joined the Deptartment of Computer Science, Nanjing University, and became an Associate Professor in 1986. His research interests include programming languages, formal claculus, artificial intelligence and computer architecture.

Lu Jianfeng received his B.S. degree from Nanjing University in 1992. Now he is a graduate student in Department of Computer Science and Technology, Nanjing University. His research interests include programming languages, formal calculus, artificial intelligence and computer architecture.

Zeng Fancong received his B.S. degree from Nanjing University in 1993. Now he is a graduate student in Department of Computer Science and Technology, Nanjing University. His research interests include programming languages, formal calculus, artificial intelligence and computer architecture.

Dai Jingwen received her B.S. degree in 1993 from Nanjing Normal University. Now she is a graduate student in Department of Computer Science and Technology, Nanjing University. Her research interests include programming languages, formal calculus, artificial intelligence and computer architecture.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, M., Lu, J., Zeng, F. et al. A formal semantics for DAI language NUML. J. of Compt. Sci. & Technol. 10, 227–238 (1995). https://doi.org/10.1007/BF02943490

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords