Relating defeasible and normal logic programming through transformation properties

This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEMneLP to more classical logic programming frameworks. In DeLP we distinguish between strict and defeasible rules, combining default and strict negation. In contrast to this, in normal logic programming (NLP), th...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Chesñevar, Carlos Iván, Dix, Jurgen, Stolzenburg, Frieder, Simari, Guillermo Ricardo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2000
Materias:
Ciencias Informáticas
Logic Programming
Nonmonotonic reasoning and belief revision
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23660
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23660
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Logic Programming
Nonmonotonic reasoning and belief revision
spellingShingle Ciencias Informáticas
Logic Programming
Nonmonotonic reasoning and belief revision
Chesñevar, Carlos Iván
Dix, Jurgen
Stolzenburg, Frieder
Simari, Guillermo Ricardo
Relating defeasible and normal logic programming through transformation properties
topic_facet Ciencias Informáticas
Logic Programming
Nonmonotonic reasoning and belief revision
description This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEMneLP to more classical logic programming frameworks. In DeLP we distinguish between strict and defeasible rules, combining default and strict negation. In contrast to this, in normal logic programming (NLP), there is one negation nut, interpreted as a kind of negation-as-failure, which introduces defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics WFS. In this paper we consider the transformation properties for NLP introduced by Brass et al. adapted within the DeLP framework. We show which transformation properties are satisfied, identifying the aspects in which NLP and DeLP differ. We contend that transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct we get that DeLP is a proper extension of NLP
format Objeto de conferencia
Objeto de conferencia
author Chesñevar, Carlos Iván
Dix, Jurgen
Stolzenburg, Frieder
Simari, Guillermo Ricardo
author_facet Chesñevar, Carlos Iván
Dix, Jurgen
Stolzenburg, Frieder
Simari, Guillermo Ricardo
author_sort Chesñevar, Carlos Iván
title Relating defeasible and normal logic programming through transformation properties
title_short Relating defeasible and normal logic programming through transformation properties
title_full Relating defeasible and normal logic programming through transformation properties
title_fullStr Relating defeasible and normal logic programming through transformation properties
title_full_unstemmed Relating defeasible and normal logic programming through transformation properties
title_sort relating defeasible and normal logic programming through transformation properties
publishDate 2000
url http://sedici.unlp.edu.ar/handle/10915/23660
work_keys_str_mv AT chesnevarcarlosivan relatingdefeasibleandnormallogicprogrammingthroughtransformationproperties
AT dixjurgen relatingdefeasibleandnormallogicprogrammingthroughtransformationproperties
AT stolzenburgfrieder relatingdefeasibleandnormallogicprogrammingthroughtransformationproperties
AT simariguillermoricardo relatingdefeasibleandnormallogicprogrammingthroughtransformationproperties
bdutipo_str Repositorios
_version_ 1764820466075172867

Ejemplares similares