Description of GADEL
Artificial Intelligence
2007-05-23 v1 Logic in Computer Science
Abstract
This 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.
Keywords
Cite
@article{arxiv.cs/0003018,
title = {Description of GADEL},
author = {I. Stephan and F. Saubion and P. Nicolas},
journal= {arXiv preprint arXiv:cs/0003018},
year = {2007}
}
Comments
System Descriptions and Demonstrations at Nonmonotonic Reasoning Workshop, 2000 6 pages, 2 figures, 5 tables