Genetic Algorithms for Extension Search in Default Logic

Details Genetic Algorithms for Extension Search in Default Logic Genetic Algorithms for Extension Search in Default Logic

2000-02-24

arxiv.org/abs/cs/0002015v1

Computer Science

Artificial Intelligence

8 pages, 3 figures, 2 tables

Scientific paper

A default theory can be characterized by its sets of plausible conclusions, called its extensions. But, due to the theoretical complexity of Default Logic (Sigma_2p-complete), the problem of finding such an extension is very difficult if one wants to deal with non trivial knowledge bases. Based on the principle of natural selection, Genetic Algorithms have been quite successfully applied to combinatorial problems and seem useful for problems with huge search spaces and when no tractable algorithm is available. The purpose of this paper is to show that techniques issued from Genetic Algorithms can be used in order to build an efficient default reasoning system. After providing a formal description of the components required for an extension search based on Genetic Algorithms principles, we exhibit some experimental results.

Affiliated with

Also associated with

No associations

Rating

Genetic Algorithms for Extension Search in Default Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Genetic Algorithms for Extension Search in Default Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Genetic Algorithms for Extension Search in Default Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358475