SciELO - Scientific Electronic Library Online

 
vol.32 número2Algorithmic definitions for KLM-style defeasible disjunctive DatalogDDLV: A system for rational preferential reasoning for Datalog índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google

Compartir


South African Computer Journal

versión On-line ISSN 2313-7835
versión impresa ISSN 1015-7999

Resumen

CHINGOMA, Julian  y  MEYER, Thomas. Defeasibility applied to Forrester's paradox. SACJ [online]. 2020, vol.32, n.2, pp.161-183. ISSN 2313-7835.  http://dx.doi.org/10.18489/sacj.v32i2.848.

Deontic logic is a logic often used to formalise scenarios in the legal domain. Within the legal domain there are many exceptions and conflicting obligations. This motivates the enrichment of deontic logic with not only the notion of defeasibility, which allows for reasoning about exceptions, but a stronger notion of typicality that is based on defeasibility. KLM-style defeasible reasoning is a logic system that employs defeasibility while Propositional Typicality Logic (PTL) is a logic that does the same for the notion of typicality. Deontic paradoxes are often used to examine logic systems as the paradoxes provide undesirable results even if the scenarios seem intuitive. Forrester's paradox is one of the most famous of these paradoxes. This paper shows that KLM-style defeasible reasoning and PTL can be used to represent and reason with Forrester's paradox in such a way as to block undesirable conclusions without completely sacrificing desirable deontic properties.CATEGORIES: Theory of computation ~ Logic Theory of computation ~ Semantics and reasoning

Palabras clave : deontic logic; defeasible reasoning; propositional typicality logic; Forrester's paradox.

        · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons