Deontic Logic Viewed as Defeasible Reasoning

1997 ◽  
pp. 123-137 ◽  
Author(s):  
Y. U. Ryu ◽  
R. M. Lee
2020 ◽  
Vol 32 (2) ◽  
Author(s):  
Julian Chingoma ◽  
Thomas Meyer

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.


2020 ◽  
Vol 117 (4) ◽  
pp. 181-218
Author(s):  
Ivan Hu ◽  

I propose a novel solution to the Sorites Paradox. The account vindicates the tolerance of vague predicates in a way that properly addresses the normativity of vagueness while avoiding sorites contradiction, by treating sorites reasoning as a type of defeasible reasoning. I show how this can be done within the setting of a nonmonotonic deontic logic. Central to the proposal is its deontic interpretation of tolerance. I draw a key distinction between two types of tolerance, based on different deontic notions, and show how the account captures key differences between these types of sorites reasoning. I compare the resulting theory to various existing contextualist proposals and argue that it better accounts for the normative aspects of sorites reasoning.


Author(s):  
Jens Claßen ◽  
James Delgrande

With the advent of artificial agents in everyday life, it is important that these agents are guided by social norms and moral guidelines. Notions of obligation, permission, and the like have traditionally been studied in the field of Deontic Logic, where deontic assertions generally refer to what an agent should or should not do; that is they refer to actions. In Artificial Intelligence, the Situation Calculus is (arguably) the best known and most studied formalism for reasoning about action and change. In this paper, we integrate these two areas by incorporating deontic notions into Situation Calculus theories. We do this by considering deontic assertions as constraints, expressed as a set of conditionals, which apply to complex actions expressed as GOLOG programs. These constraints induce a ranking of "ideality" over possible future situations. This ranking in turn is used to guide an agent in its planning deliberation, towards a course of action that adheres best to the deontic constraints. We present a formalization that includes a wide class of (dyadic) deontic assertions, lets us distinguish prima facie from all-things-considered obligations, and particularly addresses contrary-to-duty scenarios. We furthermore present results on compiling the deontic constraints directly into the Situation Calculus action theory, so as to obtain an agent that respects the given norms, but works solely based on the standard reasoning and planning techniques.


Synthese ◽  
2011 ◽  
Vol 187 (2) ◽  
pp. 623-660 ◽  
Author(s):  
Mathijs de Boer ◽  
Dov M. Gabbay ◽  
Xavier Parent ◽  
Marija Slavkovic

1996 ◽  
Vol 82 (3) ◽  
pp. 317-357 ◽  
Author(s):  
Lou Goble
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document