Description of GADEL

03/07/2000
by   I. Stephan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2000

Genetic Algorithms for Extension Search in Default Logic

A default theory can be characterized by its sets of plausible conclusio...
research
01/28/1999

Representation Theory for Default Logic

Default logic can be regarded as a mechanism to represent families of be...
research
07/16/2002

Embedding Default Logic in Propositional Argumentation Systems

In this paper we present a transformation of finite propositional defaul...
research
10/04/2011

On the Parameterized Complexity of Default Logic and Autoepistemic Logic

We investigate the application of Courcelle's Theorem and the logspace v...
research
04/28/2022

Genetic Improvement in the Shackleton Framework for Optimizing LLVM Pass Sequences

Genetic improvement is a search technique that aims to improve a given a...
research
07/24/2002

Evaluating Defaults

We seek to find normative criteria of adequacy for nonmonotonic logic si...
research
09/18/2019

Default Disambiguation for Online Parsers

Since composed grammars are often ambiguous, grammar composition require...

Please sign up or login with your details

Forgot password? Click here to reset