Skip to main content
SpringerLink
Log in

Distributed Implementation of a Connection Graph Based on Cylindric Set Algebra Operators

  • Conference paper
Formal Approaches to Agent-Based Systems (FAABS 2002)

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

Included in the following conference series:

  • 309 Accesses

Abstract

The Connection Graph structure is transformed into another type of graph that reflects the inter-relationship of the most general unifiers, by using elements of Cylindric Set Algebras, and the computation of a solution is redefined in term of computing the Transitive Closure of the graph based on this new structure, thus providing an environment for a distributed implementation.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backhouse, R.C., Carre, B.A.: Regular algebra applied to path-finding problems. J. Inst. Maths. Applics. 15, 161–186 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bibel, W.: Automated Theorem Proving. Vieweg and Sohn, Wiesbaden (1982)

    MATH  Google Scholar 

  3. Clark, K., Robinson, P.J., Hagen, R.: Programming internet based DAI applications in Qu-Prolog. In: Zhang, C., Lukose, D. (eds.) Multi-Agent Systems: Theories, Languages and Applications, Heidelberg, pp. 137–151. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Clark, K., Robinson, P.J., Hagen, R.A.: Multi-threading and message communication in Qu-Prolog. Technical Report 99-41, Software Verification Research Centre, School of Information Technology, The University of Queensland, Brisbane 4072, Australia (December 1999)

    Google Scholar 

  5. Fisher, M., Wooldridge, M.: Distributed problem-solving as concurrent theorem-proving. In: Boman, M., Van de Velde, W. (eds.) MAAMAW 1997. LNCS, vol. 1237. Springer, Heidelberg (1997)

    Google Scholar 

  6. Kowalski, R.A.: A proof procedure using connection graphs. J. ACM 22(4), 572–595 (1975)

    Article  MATH  Google Scholar 

  7. Monk, J.D., Henkin, L., Tarski, A.: Cylindric Algebra, part 1. North-Holland, Amsterdam (1971)

    Google Scholar 

  8. Scott, D.: Data type as latices. Siam Journal of Computing 5(3), 522–587 (1976)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College,  

    Silvana Zappacosta Amboldi

Authors
  1. Silvana Zappacosta Amboldi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Loyola College in Maryland, MD 21210, Baltimore, USA

    Michael G. Hinchey

  2. Advanced Architectures and Automation Branch, NASA Goddard Space Flight Center, MD 20771, Greenbelt, USA

    James L. Rash

  3. NASA Goddard Space Flight Center, MD 20771, Greenbelt, USA

    Walter F. Truszkowski

  4. Advanced Technology Laboratories, Lockheed Martin Corporation, VA 22203, Arlington, USA

    Christopher Rouff

  5. Computer Science Department, University ofWyoming, WY 82070, Laramie, USA

    Diana Gordon-Spears

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amboldi, S.Z. (2003). Distributed Implementation of a Connection Graph Based on Cylindric Set Algebra Operators. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C., Gordon-Spears, D. (eds) Formal Approaches to Agent-Based Systems. FAABS 2002. Lecture Notes in Computer Science(), vol 2699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45133-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45133-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45133-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation