An alternative approach to the revision of ordinal conditional functions in the context of multi-valued logic

Authors:
Klaus Häming;Gabriele Peters
Affiliations:
University of Applied Sciences and Arts, Computer Science, Visual Computing, Dortmund, Germany;University of Applied Sciences and Arts, Computer Science, Visual Computing, Dortmund, Germany
Venue:
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Year:
2010

Citing 6
Cited 1

On the logic of iterated belief revision

Artificial Intelligence
Relational reinforcement learning

Machine Learning - Special issue on inducive logic programming
Introduction to Reinforcement Learning

Introduction to Reinforcement Learning
2007 Special Issue: The interaction of implicit learning, explicit hypothesis testing learning and implicit-to-explicit knowledge extraction

Neural Networks
Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents

Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents
A fuzzy controller with supervised learning assisted reinforcement learning algorithm for obstacle avoidance

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Towards a Self-Learning Agent: Using Ranking Functions as a Belief Representation in Reinforcement Learning

Neural Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.