Deontic Meta-Rules

  title={Deontic Meta-Rules},
  author={Francesco Olivieri and Guido Governatori and Matteo Cristani and Antonino Rotolo and A. Sattar},
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of nonmonotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions of such theories were proposed in [65]. This work extends such a logical framework by considering the deontic aspect. The resulting logic will not just be able to model policies but also tackle well-known aspects that occur in numerous legal systems. The use… 



The Logic of Conditionals: An Application Of Probability To Deductive Logic

This chapter discusses motivation for Wanting to Assure the Soundness of Reasoning and a Hypothesis Concerning Counterfactuals Probability Change Aspects of Inference.

Computing Defeasible Meta-logic

This work introduces a variant of DL, Defeasible Meta-Logic, to represent defeasible meta-theories, by proposing efficient algorithms to compute the (meta-)extensions of such theories, and by proving their computational complexity.

Changing legal systems: legal abrogations and annulments in Defeasible Logic

This paper proposes a temporal extension of Defeasible Logic suitable to express this model and to capture abrogation and annulment, and shows that the proposed framework overcomes the difficulties discussed in regard to belief and base revision, and is sufficiently flexible to represent many of the subtleties characterizing legal abrogations andannulments.

Computing Strong and Weak Permissions in Defeasible Logic

Some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights are discussed and it is illustrated how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions.

High-Level Programs and Program Conditions

This work investigates program conditions, a generalized type of conditions expressing properties on program derivations that look like nested rules with application conditions, and presents a normal form result, a suitable graphical notation, and conditions under which a satisfying program can be constructed from a program condition.

Changes to temporary norms

This paper addresses the problem of modifying temporary norms that are represented by means of the combination of two known formalisms in the current literature, and results in four novel operators that anticipate and extend norms in two different combined ways.

The rationale behind the concept of goal

A fresh look at the concept of goal is proposed and it is advances that motivational attitudes like desire, goal and intention are just facets of the broader notion of (acceptable) outcome.

A Logic for the Interpretation of Private International Law

Unravel legal references in defeasible deontic logic

An approach to directly model the references in a logic language and to resolve them during the computation of the legal effects in force in a case is proposed and proved to be computationally feasible and to have an efficient algorithms implementation.

Arguments, Meta-arguments, and Metadialogues: A Reconstruction of Krabbe, Govier, and Woods

Krabbe (2003, in F.H. van Eemeren, J.A. Blair, C.A. Willard and A.F. Snoeck Henkemans (eds.), Proceedings of the Fifth Conference of the International Society for the Study of Argumentation, Sic Sat,