Skip to main content

An Alternative Approach to the Revision of Ordinal Conditional Functions in the Context of Multi-Valued Logic

  • Conference paper
Artificial Neural Networks – ICANN 2010 (ICANN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6353))

Included in the following conference series:

Abstract

We discuss the use of Ordinal Conditional Functions (OCF) in the context of Reinforcement Learning while introducing a new revision operator for conditional information. The proposed method is compared to the state-of-the-art method in a small Reinforcement Learning application with added futile information, where generalization proves to be advantageous.

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 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. Alchourron, C.E., Gardenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. J. Symbolic Logic 50(2), 510–530 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artificial intelligence 89, 1–29 (1996)

    Article  MathSciNet  Google Scholar 

  3. Dzeroski, S., De Raedt, L., Driessens, K.: Relational reinforcement learning. Machine Learning 43, 7–52 (2001)

    Article  MATH  Google Scholar 

  4. Kern-Isberner, G.: Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents. Springer, New York (2001)

    Book  MATH  Google Scholar 

  5. Leopold, T., Kern Isberner, G., Peters, G.: Combining reinforcement learning and belief revision: A learning system for active vision. In: BMVC 2008, pp. 473–482 (2008)

    Google Scholar 

  6. Reber, A.S.: Implicit learning and tacit knowledge. Journal of Experimental Psycology: General 3(118), 219–235 (1989)

    Article  Google Scholar 

  7. Spohn, W.: Ordinal conditional functions: A dynamic theory of epistemic states. In: Causation in Decision, Belief Change and Statistics, pp. 105–134 (August 1988)

    Google Scholar 

  8. Sun, R., Merrill, E., Peterson, T.: From implicit skills to explicit knowledge: A bottom-up model of skill learning. Cognitive Science 25, 203–244 (2001)

    Article  Google Scholar 

  9. Sun, R., Zhang, X., Slusarz, P., Mathews, R.: The interaction of implicit learning, explicit hypothesis testing, and implicit-to-explicit knowledge extraction. Neural Networks 1(20), 34–47 (2006)

    Google Scholar 

  10. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)

    Google Scholar 

  11. Ye, C., Yung, N.H.C., Wang, D.: A fuzzy controller with supervised learning assisted reinforcement learning algorithm for obstacle avoidance. IEEE Transactions on Systems, Man, and Cybernetics, Part B 33(1), 17–27 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Häming, K., Peters, G. (2010). An Alternative Approach to the Revision of Ordinal Conditional Functions in the Context of Multi-Valued Logic. In: Diamantaras, K., Duch, W., Iliadis, L.S. (eds) Artificial Neural Networks – ICANN 2010. ICANN 2010. Lecture Notes in Computer Science, vol 6353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15822-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15822-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15821-6

  • Online ISBN: 978-3-642-15822-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics