Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1983))

  • 1305 Accesses

Abstract

As a computational approach, a framework is proposed for computing the limits of formal theory sequences. It defines a class of agents, called convergent agents. The approach provides a method to generate a new theory by the limit of some sequence of theories, and also has potential applications to many scientific and engineering problems. As applications of the framework, some convergent agents are discussed briey, e.g., GUINA, which can learn new versions from the current versions of a theory and some external samples, and the learned versions converge to the truth one wants to know.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Blum, L., Cuker, F., Shub, M. and Smale, S.,Complexity and Real Com-putation, Springer-Verlager, 1998.

    Google Scholar 

  2. Chang, C.C, and Keisler, H.J., Model Theory, third edition, North-Holland Publishing Company, 1990.

    Google Scholar 

  3. Li, W.,An Open Logic System, Science in China (Scientia Sinica)(series A), No.10, (in Chinese), 1992, 1103–1113.

    Google Scholar 

  4. Li, W., A Logical Framework for Evolution of Specifications, Programming Languages and Systems, (ESOP’94), LNCS 788, Sringer-Verlag, 1994, 394–408.

    Google Scholar 

  5. Li, W.,A logical Framework for Inductive Inference and Its rationality, Ad-vanced Topics in Artificial Intelligence, Fu, N.(eds.), LNAI 1747, Springer, 1999.

    Google Scholar 

  6. Li, W. and Ma, S.,A Framework for Analytic-Intelligent Agents, Proceed-ings of the International Conference on Artificial Intelligence, Las Vegas, USA, June 26–29, 2000, CSREA Press, 691–697.

    Google Scholar 

  7. Li, W. and Ma, S.,Limits of Theory Sequences over Algebraically Closed Fields and Applications, Technical Report, The National Lab. of Software Development Environment, Beijing University of Aeronautics and Astro-nautics, 2000.

    Google Scholar 

  8. Reiter, R.,A Logic for Default Reasoning, Artificial Intelligence, 13(1980), 81–132.

    Google Scholar 

  9. Wu, W.,On Zeros of Algrbraic Equations-An Application of Ritt’s Prin-ciple, Kexue Tongbao, 31(1986), 1–5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, W. (2000). A Computational Framework for Convergent Agents. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-44491-2_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41450-6

  • Online ISBN: 978-3-540-44491-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics