Reactive Kripke models and contrary to duty obligations. Part A: Semantics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reactive Kripke Models and Contrary to Duty Obligations

Contrary to duties (CTD) are dealt with in the framework of standard deontic logic (SDL), and ordinary Kripke possible world models. Given a world t, one associates statically a non-empty set I(t) of ideal worlds for t and t Oq (q is obligatory for t) if q holds in all the worlds of I(t). This is a static perception of obligation. If we have to list as t the set of all obligations for the world...

متن کامل

Contrary-to-Duty Obligations

We investigate under what conditions contrary-to-duty (CTD) structures lacking temporal and action elements can be given a coherent reading. We argue, contrary to some recent proposals, that CTD is not an instance of defeasible reasoning, and that methods of nonmonotonic logics are inadequate since they are unable to distinguish between defeasibility and violation of primary obligations. We pro...

متن کامل

Contrary to Duty Obligations A Study in Legal Ontology

In this paper the problems in deontic logic around contrary to duty obligations are used to conduct a study in basic normative ontology. Three causes of the problems around contrary to duty obligations are identified, that is 1) the attempt to analyze obligations in terms of what is ideally the case, 2) the application of deontic inheritance to the presuppositions of obligations, and 3) the fai...

متن کامل

The Equational Approach to Contrary-to-duty Obligations

We present in this talk different techniques for quickly answer graph problems where some of the nodes may be turn off. Typical graph problems are such as connectivity or distances between pair of nodes but not only. Emergency planing for such problems is achieved by pre-processing the graphs and by virtually preventing all possible subsequent node removals. To obtain efficient data structures,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Logic

سال: 2013

ISSN: 1570-8683

DOI: 10.1016/j.jal.2012.08.001