Back to Search
Start Over
Defeasibility applied to Forrester’s paradox
- Source :
- South African Computer Journal, Vol 32, Iss 2 (2020)
- Publication Year :
- 2020
- Publisher :
- South African Institute of Computer Scientists and Information Technologists, 2020.
-
Abstract
- 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.
- Subjects :
- Computer Networks and Communications
Computer science
Deontic logic
Legal domain
ComputingMethodologies_ARTIFICIALINTELLIGENCE
lcsh:QA75.5-76.95
Computer Science Applications
Education
Epistemology
Human-Computer Interaction
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Block (programming)
lcsh:T58.6-58.62
lcsh:Management information systems
lcsh:Electronic computers. Computer science
Defeasible reasoning
Hardware_LOGICDESIGN
Information Systems
Subjects
Details
- ISSN :
- 23137835 and 10157999
- Volume :
- 32
- Database :
- OpenAIRE
- Journal :
- South African Computer Journal
- Accession number :
- edsair.doi.dedup.....b5156e37bfddb59a109a411f2cba9c28
- Full Text :
- https://doi.org/10.18489/sacj.v32i2.848