By Topic

Finding least cost proofs using high order recurrent networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. M. Abdelbar ; Dept. of Comput. Sci., American Univ. in Cairo, Egypt ; E. A. M. Andrews ; G. A. Tagliarini

Cost-based abduction (CBA) is an important AI formalism for representing knowledge under uncertainty. In this formalism, evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete the least-cost proof are taken as the best explanation for the given evidence. The problem of finding the least-cost proof for a given CBA system is NP-hard and current techniques have exponential complexity in the worst case. Computational intelligence approaches to this problem have not been previously explored. In this paper, we show how high order recurrent networks can be used to find least-cost proofs for CBA instances. We describe experimental results on 80 CBA instances using networks of up to 68 neurons.

Published in:

Neural Networks, 2003. Proceedings of the International Joint Conference on  (Volume:4 )

Date of Conference:

20-24 July 2003