Genetic Algorithms for Extension Search in Default Logic
| dc.creator | Nicolas, P. | |
| dc.creator | Saubion, F. | |
| dc.creator | Stephan, I. | |
| dc.date | 2000-02-24 | |
| dc.date.accessioned | 2026-07-07T03:15:55Z | |
| dc.date.available | 2026-07-07T03:15:55Z | |
| dc.description | 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. | |
| dc.description | 8 pages, 3 figures, 2 tables | |
| dc.identifier | https://arxiv.org/abs/cs/0002015 | |
| dc.identifier | http://arxiv.org/abs/cs/0002015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30161 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1 | |
| dc.title | Genetic Algorithms for Extension Search in Default Logic | |
| dc.type | text |