Description of GADEL

Simple item page
dc.creatorStephan, I.
dc.creatorSaubion, F.
dc.creatorNicolas, P.
dc.date2000-03-07
dc.date.accessioned2026-07-07T03:15:58Z
dc.date.available2026-07-07T03:15:58Z
dc.descriptionThis article describes the first implementation of the GADEL system : a Genetic Algorithm for Default Logic. The goal of GADEL is to compute extensions in Reiter's default logic. It accepts every kind of finite propositional default theories and is based on evolutionary principles of Genetic Algorithms. Its first experimental results on certain instances of the problem show that this new approach of the problem can be successful.
dc.descriptionSystem Descriptions and Demonstrations at Nonmonotonic Reasoning Workshop, 2000 6 pages, 2 figures, 5 tables
dc.identifierhttps://arxiv.org/abs/cs/0003018
dc.identifierhttp://arxiv.org/abs/cs/0003018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30180
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectF.4.1
dc.titleDescription of GADEL
dc.typetext

Files

Collections

arXiv