2,148 research outputs found
Description of GADEL
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.Comment: System Descriptions and Demonstrations at Nonmonotonic Reasoning
Workshop, 2000 6 pages, 2 figures, 5 table
On the connection between default logic and DELP
In this paper, we establish a relation between an argumentation based system: Defeasible Logic Programming (DELP), and a nonmonotonic system: Reiter’s Default Logic. This relation is achieved by introducing a variant of DELP and a transformation that maps default theories to defeasible logic programs. The transformation allows to associate the answers of a DELP Interpreter with the consequences, credulous and skeptical, of the default theory. Thus, this work establishes a link between a well understood nonmonotonic system and a argumentation based system. This link could be studied separately and could be exploited for the development of the latter system.Red de Universidades con Carreras en Informática (RedUNCI
Logical properties in defeasible logic programming -a preliminary report
Logics for nonmonotonic reasoning have often been described by the property they lack-that is, monotonicity-instead of by those they do enjoy. These theories flourished in the early `80s in response to the inconveniences incomplete and changing information posed to classic, monotonic approaches. Several nonmonotonic formalisms were introduced in the literature: inheritance networks, default logic, preferential entailment, autoepistemic logic, and defeasible argumentation among others. The introduction of these proposals in a short span of time made it difficult to decide which approach is best suited for a given context.Eje: Aspectos teóricos de inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI
On the connection between default logic and DELP
In this paper, we establish a relation between an argumentation based system: Defeasible Logic Programming (DELP), and a nonmonotonic system: Reiter’s Default Logic. This relation is achieved by introducing a variant of DELP and a transformation that maps default theories to defeasible logic programs. The transformation allows to associate the answers of a DELP Interpreter with the consequences, credulous and skeptical, of the default theory. Thus, this work establishes a link between a well understood nonmonotonic system and a argumentation based system. This link could be studied separately and could be exploited for the development of the latter system.Red de Universidades con Carreras en Informática (RedUNCI
Reasoning about Minimal Belief and Negation as Failure
We investigate the problem of reasoning in the propositional fragment of
MBNF, the logic of minimal belief and negation as failure introduced by
Lifschitz, which can be considered as a unifying framework for several
nonmonotonic formalisms, including default logic, autoepistemic logic,
circumscription, epistemic queries, and logic programming. We characterize the
complexity and provide algorithms for reasoning in propositional MBNF. In
particular, we show that entailment in propositional MBNF lies at the third
level of the polynomial hierarchy, hence it is harder than reasoning in all the
above mentioned propositional formalisms for nonmonotonic reasoning. We also
prove the exact correspondence between negation as failure in MBNF and negative
introspection in Moore's autoepistemic logic
- …