Input/Output Logics

نویسندگان

  • David Makinson
  • Leon van der Torre
چکیده

In a range of contexts, one comes across processes resembling inference, but where input propositions are not in general included among outputs, and the operation is not in any way reversible. Examples arise in contexts of conditional obligations, goals, ideals, preferences, actions, and beliefs. Our purpose is to develop a general theory of propositional input/output operations. Particular attention is given to the special case where outputs may be recycled as inputs.

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

ثبت نام

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

منابع مشابه

Frederik Van De Putte Adaptive Logic Characterizations of Input / Output Logic

We translate unconstrained and constrained input/output logics as introduced by Makinson and van der Torre to modal logics, using adaptive logics for the constrained case. The resulting reformulation has some additional benefits. First, we obtain a prooftheoretic (dynamic) characterization of input/output logics. Second, we demonstrate that our framework naturally gives rise to useful variants ...

متن کامل

Computational Complexity of Input/Output Logic

Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output logics. We show that the lower bound of the complexity of the fulfillment problem of 4 input/output logics is coNP, while the upper bound is either coNP or P .

متن کامل

On the Complexity of Input/Output Logic

The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of four existing input/output logics. We show that the lower bound of the complexity of the fulfillment problem of these input/output logics is coNP, while the upper bound is either coNP, or P .

متن کامل

Permissions and Undercutters

Input/output logics have been proposed to formalize rule based inference. They are mainly inspired by deontic logic, or the logic of obligations, although it has also been shown that they generalize for example Reiter’s normal default logic. A recent extension of the input/output logics formalizes various notions of permission. We are interested in the question whether input/output logics can b...

متن کامل

Permissions and Undercutters in Argumentation

Input/output logics have been proposed to formalize rule based inference. They are mainly inspired by deontic logic, or the logic of obligations, although it has also been shown that they generalize for example Reiter’s normal default logic. A recent extension of the input/output logics formalizes various notions of permission. We are interested in the question whether input/output logics can b...

متن کامل

Interaction in Normative Multi-Agent Systems

The central research question of this paper is how notions developed in interactive computing such as abstract behavior types, the coordination language Reo, and Boolean circuits with registers, can be used to extend logical input/output nets, or lions for short. Lions are based on input/output logic, a deontic logic which is not used as a (non-classical) inference engine deriving output from i...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • J. Philosophical Logic

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2000