Skip to main content
SpringerLink
Log in

Logic and Geometry of Agents in Agent-Based Modeling

  • Reference work entry
Computational Complexity

  • 278 Accesses

Article Outline

Glossary

Definition of the Subject

Introduction

Towards a Logic and Geometry of Interaction

Further Directions

Bibliography

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,500.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,399.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Abbreviations

Agent :

A computational or biological entity which can perform actions which affect its environment, and observe actions performed by the environment or other agents.

Agent‐based modeling:

Modeling a complex system in terms of multiple agents interacting with each other.

Interaction :

A pattern of actions in a multi‐agent system. Each action is performed by some agent, and may be observed by others.

Information flow :

The process whereby information held by one agent or part of a system is transferred to another, possibly in some modified form. Generally mediated by interaction: information flow is caused by agents performing actions, and other agents observing those actions.

Compositionality :

Describing a complex system or object in a structured fashion, as built up by applying certain operations hierarchically, starting from a stock of basic types of system. Compositional definitions of functions of systems are those which respect this hierarchical structure.

Linear logic :

A sub‐structural logic in which the operations of copying and deleting premises are not allowed in general.

Combinators:

Basic operations in a function algebra. Combinatory logic is a variable‐free formulation of functional computation.

Bibliography

Primary Literature

  1. Abramsky S (1996) Retracing some paths in process algebra. In: Proc of CONCUR 96. Lectures notes in computer science, vol 1119. Springer, Berlin, pp 1–17

    Google Scholar 

  2. Abramsky S (2002) Algorithmic game semantics: a tutorial introduction. In: Proof and system‐reliability. Kluwer, Dordrecht

    Google Scholar 

  3. Abramsky S (2004) High‐level methods for quantum computation and information. In: Proc of the 19th annual IEEE symposium on logic in computer science. IEEE Computer Science Press, Los Alamitos pp 410–414

    Google Scholar 

  4. Abramsky S (2005) Abstract scalars, loops, and free traced and strongly compact closed categories. In: Proc of CALCO 2005. Springer lecture notes in computer science, vol 3629. Springer, Berlin, pp 1–31

    Google Scholar 

  5. Abramsky S (2007) Temperley–Lieb algebras and geometry of interaction. In: Chen G, Kauffman L, Lamonaco S (eds) Mathematics of quantum computing and technology. Chapman and Hall/CRC, Boca Raton, pp 413–458

    Google Scholar 

  6. Abramsky S, Coecke B (2004) A categorical semantics of quantum protocols. In: Proc of the 19th Annual IEEE symposium on logic in computer science: LICS 2004. IEEE Computer Society, Los Alamitos, pp 415–425

    Chapter  Google Scholar 

  7. Abramsky S, Coecke B (2005) Abstract physical traces. Theory Appl Categ 14:111–124

    MathSciNet  MATH  Google Scholar 

  8. Abramsky S, Jagadeesan R (1994) New foundations for the geometry of interaction. Inform Comput 111:53–119

    Article  MathSciNet  MATH  Google Scholar 

  9. Abramsky S, Jagadeesan R (1994) Games and full completeness for multiplicative linear logic. J Symb Log 59:543–574

    Article  MathSciNet  MATH  Google Scholar 

  10. Abramsky S, Jagadeesan R (2005) A game semantics for generic polymorphism. Ann Pure Appl Log 133:3–37

    Article  MathSciNet  MATH  Google Scholar 

  11. Abramsky S, McCusker G (1997) Linearity, sharing and state. In: O'Hearn P, Tennent RD (eds) Algol‐like languages. Birkhauser, Basel, pp 317–348

    Google Scholar 

  12. Abramsky S, McCusker G (1999) Full abstraction for idealized Algol with passive expressions. Theor Comput Sci 227:3–42

    Article  MathSciNet  MATH  Google Scholar 

  13. Abramsky S, McCusker G (1999) Game semantics. In: Computational logic: Proc of the 1997 Marktoberdorf Summer School. Springer, Berlin, pp 1–56

    Google Scholar 

  14. Abramsky S, Mellies P-A (1999) Concurrent games and full completeness. In: Proc of the 14th international symposium on logic in computer science. Computer Society Press of the IEEE, Los Alamitos, pp 431–442

    Google Scholar 

  15. Abramsky S, Honda K, McCusker G (1998) A fully abstract game semantics for general references. In: Proc of the 13th international symposium on logic in computer science. Computer Society Press of the IEEE, Los Alamitos, pp 334–344

    Google Scholar 

  16. Abramsky S, Jagadeesan R, Malacaria P (2000) Full abstraction for PCF. Inform Comput 163:409–470

    Article  MathSciNet  MATH  Google Scholar 

  17. Abramsky S, Ghica DR, Murawski AS, Ong C-HL (2004) Applying game semantics to compositional software modeling and verification. In: Proc TACAS'04. LNCS, vol 2988. pp 421–435

    Google Scholar 

  18. Abramsky S, Ghica DR, Murawski AS, Stark IDB, Ong C-HL (2004) Nominal games and full abstraction for the nu‐calculus. In: Proc LICS'04. IEEE Computer Society Press, Los Alamitos, pp 150–159

    Google Scholar 

  19. Blute R, Scott PJ (1998) The Shuffle Hopf Algebra and noncommutative full completeness. J Symb Log 63(4):1413–1436

    Article  MathSciNet  MATH  Google Scholar 

  20. Blute R, Hamano M, Scott PJ (2005) Softness of hypercoherences and MALL full completeness. Ann Pure Appl Log 131(1–3):1–63

    Article  MathSciNet  MATH  Google Scholar 

  21. Danos V, Harmer R (2002) Probabilistic game semantics. ACM Trans Comput Log 3(3):359–382

    Article  MathSciNet  Google Scholar 

  22. Devarajan H, Hughes D, Plotkin G, Pratt V (1999) Full completeness of the multiplicative linear logic of Chu spaces. In: Proc of the 14th Annual IEEE symposium on logic in computer science. pp 234–242

    Google Scholar 

  23. Dirac PAM (1947) Principles of quantum mechanics. Oxford University Press, Oxford

    MATH  Google Scholar 

  24. Ghica DR, McCusker G (2000) Reasoning about idealized algol using regular languages. In: Proc ICALP'00. LNCS, vol 1853. pp 103–116

    Google Scholar 

  25. Ghica DR, Murawski AS (2004) Angelic semantics of fine‐grained concurrency. In: Proc FOSSACS'04. LNCS, vol 2987. pp 211–225

    Google Scholar 

  26. Ghica DR, Murawski AS (2006) Compositional model extraction for higher‐order concurrent programs. In: Proc TACAS'06. LNCS

    Google Scholar 

  27. Girard J-Y (1987) Linear logic. Theor Comput Sci 50(1):1–102

    Article  MathSciNet  MATH  Google Scholar 

  28. Girard J-Y (1989) Geometry of interaction I: interpretation of system F. In: Ferro R et al (eds) Logic Colloquium ‘88. Elsevier, Amsterdam, pp 221–260

    Google Scholar 

  29. Harmer R, McCusker G (1999) A fully abstract game semantics for finite nondeterminism. In: Proc 14th Annual IEEE symposium on logic in computer science. IEEE Computer Society Press, Los Alamitos

    Google Scholar 

  30. Hughes D (2000) Hypergame semantics: full completeness for system F. D Phil Mathematical Sciences. Oxford University, Oxford

    Google Scholar 

  31. Hyland JME, Ong C-HL (2000) On full abstraction for PCF: i. models, observables and the full abstraction problem, ii. dialogue games and innocent strategies, iii. a fully abstract and universal game model. Informat Comput 163:285–408

    Article  MathSciNet  MATH  Google Scholar 

  32. Jones VFR (1985) A polynomial invariant for links via von Neumann algebras. Bull Amer Math Soc 129:103–112

    Article  Google Scholar 

  33. Kauffman LH (1990) An invariant of regular isotopy. Trans Amer Math Soc 318(2):417–471

    Article  MathSciNet  MATH  Google Scholar 

  34. Kelly GM, Laplaza ML (1980) Coherence for compact closed categories. J Pure Appl Algebra 19:193–213

    Article  MathSciNet  MATH  Google Scholar 

  35. Laird J (1997) Full abstraction for functional languages with control. In: Proc of the 12th Annual symposium on logic in computer science, LICS '97. Extended abstract

    Google Scholar 

  36. Laird J (2001) A fully abstract games semantics of local exceptions. In: Proc of the 16th Annual symposium on logic in computer science, LICS ’01. Extended abstract

    Google Scholar 

  37. Loader R (1994) Models of Lambda calculi and linear logic. D Phil thesis. Oxford University, Oxford

    Google Scholar 

  38. Murawski AS, Ong C-HL, Walukiewicz I (2005) Idealized Algol with ground recursion and DPDA equivalence. In: Proc ICALP'05. LNCS, vol 3580. pp 917–929

    Google Scholar 

Books and Reviews

  1. Girard J-Y, Lafont Y, Taylor P (1989) Proof and types. Cambridge Tracts in Theoretical Computer Science

    Google Scholar 

  2. Hindley JR, Seldin JP (1986) Introduction to combinators and the λ‑calculus. Cambridge University Press, Cambridge

    Google Scholar 

  3. Kauffman LH (1994) Knots in physics. World Scientific Press, Singapore

    Google Scholar 

  4. Troelstra AS (1992) Lectures on linear logic. Center for the Study of Language and Information Lecture Notes No. 29

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford University Computing Laboratory, Oxford, UK

    Samson Abramsky

Authors
  1. Samson Abramsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RAMTECH LIMITED, 122 Escalle Lane, Larkspur, CA, 94939, USA

    Robert A. Meyers Ph. D. (Editor-in-Chief) (Editor-in-Chief)

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag

About this entry

Cite this entry

Abramsky, S. (2012). Logic and Geometry of Agents in Agent-Based Modeling. In: Meyers, R. (eds) Computational Complexity. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1800-9_113

Download citation

Publish with us

Policies and ethics

Search

Navigation