deon98bib.bib

@inproceedings{sergot98method,
  abstract = {The Kanger-Lindahl theory of normative positions attempts to use a combination of deontc logic and a logic of action/agency to give a formal account of obligations, duties, rights, and other complex normative concepts. The paper presents a generalization and further development of the Kanger-Lindahl theory, together with methods for its automation and application to practical examples. Particular attention is paid to representations at varying levels of detail, in order that the analysis of examples can be constructed in steps by a process of progressive refinement. The resulting inference methods can be formulated as a simple graph-colouring algorithm, as implemented in the computer program Norman-G.},
  author = {Marek Sergot},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 17:07:08 +0200},
  date-modified = {2008-06-26 17:07:08 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {387--407},
  publisher = {Informal Proceedings},
  title = {A Method for Automating the Analysis of Normative Positions},
  year = {1998}
}
@inproceedings{firozabadi98formal,
  abstract = {The aim of this paper is to give formal definitions for fraud situations that can occur in an organized interaction between a number of agents. A distinction between a normative system and its control system is made for specification of these systems. It is argued that a fraud case is one which contains a violation occurring in the normative system and a lie about the fulfilment of that obligation towards the existing control system. The role of deontic logic is discussed for specification of a class of control systems called detective control systems. The fraud definitions given in this paper are given using modal operators in Deontic, Action and Epistemic logic.},
  author = {Babak Sadighi Firozabadi and Yao-Hua Tan},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:58:01 +0200},
  date-modified = {2008-06-26 16:58:01 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {371--385},
  publisher = {Informal Proceedings},
  title = {Formal Models of Fraud},
  year = {1998}
}
@inproceedings{ramos98deontic,
  abstract = {There are already approaches that show how deontic logic can be used in a theory of diagnosis based on minimal sets. In those approaches deontic notions are represented by a propositional language enriched with violation constants. However, diagnoses based on minimal sets are insufficient to capture the specificities of process design diagnosis. In organizational process design it is important to have a preventive diagnosis that, not only detects violations (minimal diagnosis), but also detects cases of unfulfilled obligations. Deontic notions based on violation constants are not adequate if we consider more than minimal diagnosis, mainly because of conditional obligations. In this paper we present an extension of minimal diagnosis theory that addresses process design specificities, and a modal deontic logic that supports this extended theory.},
  author = {Pedro Ramos and Jos{\'e} Luiz Fiadeiro},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:52:47 +0200},
  date-modified = {2008-06-26 16:52:47 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {353--369},
  publisher = {Informal Proceedings},
  title = {A Deontic Logic for Diagnosis of Organizational Process Design},
  year = {1998}
}
@inproceedings{mcnamara98andersonian,
  abstract = {I recast the DWE-ish deontic framework as an Andersonian-Kangerian modal framework and explore its metatheory systematically and efficiently.},
  author = {Paul McNamara},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:46:16 +0200},
  date-modified = {2008-06-26 16:46:16 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {331--351},
  publisher = {Informal Proceedings},
  title = {Andersonian-Kangerian Dwe-ish Logics},
  year = {1998}
}
@inproceedings{torre98update,
  abstract = {In this paper we propose the deontic logic DUS, that formalizes reasoning about prescriptive obligations in update semantics. In DUS the definition of logical validity of obligations is not based on truth values but on action dynamics. You know the meaning of a normative sentence if you know the change it brings about in the betterness relation of anyone who is subjected to the news conveyed by it.},
  author = {Leendert W. N. van der Torre},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:41:35 +0200},
  date-modified = {2008-06-26 17:11:55 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {409--426},
  publisher = {Informal Proceedings},
  title = {An Update Semantics for Deontic Reasoning},
  year = {1998}
}
@inproceedings{krogh98protocol,
  abstract = {This paper offers arguments in favour of employing normative notions and deontic logic when analysing cryptographic protocols. It also identifies a new class of protocol flaws called violation flaws.},
  author = {Christen Krogh and Andrew J. I. Jones},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:32:35 +0200},
  date-modified = {2008-06-26 16:32:35 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {291--308},
  publisher = {Informal Proceedings},
  title = {Protocol Breaches and Violation Flaws},
  year = {1998}
}
@inproceedings{krabbendam98contextual,
  abstract = {There are many deontic logical systems in literature. Some deontc logics model universal obligations, others obligations in the current state. An example of the first is Anderson's reduction, an example of the second category is Standard Deontic Logic. A third category is more or less in between, and examples are dyadic deontic lgocis. Also, there is a distinction between ought-to-do and ought-to-be deontic logics. Some ought-to-be deontic logics are mentioned above, whereas an example of ought-to-do is Meyer's reduction. There is a similarity between the universal obligation's of Anderson's ought-to-be reduction and the current obligations in Meyer's ought-to-do reduction. These two deontic logics are the most outlying logics in a variety of deontic logics with obligations which are neither universal, nor local. In this paper the alethinc modality in Anderson's reduction is weakened to a restricted form of necessity and Meyer's reduction is strengthened, applying the same technique. This approach of restricted forms of necessity can be expressed by the so-called release logic. It is a modal logic which is particularly well-fitted for partial specifications, hence, contextual obligations. Finally, both ought-to-{be,do} reductions will be combined in one single contextual deontic logic.},
  author = {Jeroen Krabbendam and {\text{J.-J. Ch.}} Meyer},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:29:23 +0200},
  date-modified = {2008-06-26 16:29:23 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {271--290},
  publisher = {Informal Proceedings},
  title = {Contextual Deontc Logic},
  year = {1998}
}
@inproceedings{hansen98relations,
  abstract = {The aim of this essay is to tie up some loose ends in deontic logic. Under consideration are two particularly strong deontic systems: {\AA}qvist's dyadic deontic logic G and van Eck's system of temporally relative deontic logic. From van Eck's system of quantificational deontic temporal logic QDTL a corresponding propositional deontic temporal system DTL is constructed to which Arrow's Axiom is added and the resulting system called DTL+. I prove that any ``temporally indexed" theorem of G becomes a valid sentence of DTL+ and that any sentence in the language of G which when temporally indexed is valid in DTL+ is valid in G also. Metaphorically speaking, standard dyadic deontic logic as represented by G is the logic of a snap shot taken of any temporal deontic model at any point of time.},
  author = {J\"org Hansen},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:20:03 +0200},
  date-modified = {2008-06-26 16:20:03 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {253--270},
  publisher = {Informal Proceedings},
  title = {On Relations Netween {\AA}qvist's Deontic Logic System G and Van Eck's Deontic Temporal Logic},
  year = {1998}
}
@inproceedings{hage98semantics,
  abstract = {Naturalistic theories of deontic reasoning assume that it is possible to give the truth conditions of deontic sentences by means of solely non-deontic sentences. In this paper it is argued that the fashionable model-theoretic semantics for deontic logic is biased toward the widely shared presupposition that such naturalistic theories are false. A brief argument is given for a naturalistic theory of practical reasoning and it is shown how such a theory can be given a model-theoretic semantics. The argument hinges amongst others on a strict distinction between deontic rules and deontic facts and on the treatment of rules as logical individuals.},
  author = {Jaap Hage},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:09:36 +0200},
  date-modified = {2008-06-26 16:09:36 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {235--252},
  publisher = {Informal Proceedings},
  title = {Semantics for a Fragment of Moderately Naturalistic Deontic Logic},
  year = {1998}
}
@inproceedings{goble98deontic,
  abstract = {This paper investigates how deontic logic may be combined with relevant logic. Approached in one way deontic principles join easily with relevance. Somewhat surprisingly, approached in another way, which seems a generalization of the first, they combine far less well.},
  author = {Lou Goble},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 16:03:12 +0200},
  date-modified = {2008-06-26 16:03:12 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {217--234},
  publisher = {Informal Proceedings},
  title = {Deontic Logic with Relevance},
  year = {1998}
}
@inproceedings{gabbay98dealing,
  abstract = {In this paper, following Scott's advice, we argue that normative reasoning can be represented in a multi-setting framework; in particular in a multi-modal one, where modalities are indexed. Indexed modalities can model several aspects involved in normative reasoning. Systems are combined using Gabbay's fibring methodology which provides complete semantics that can be used to model a labelled tableau like proofs system.},
  author = {Dov M. Gabbay and Guido Governatori},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:59:14 +0200},
  date-modified = {2008-06-26 15:59:14 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {197--216},
  publisher = {Informal Proceedings},
  title = {Dealing with Label Dependent Deontic Modalities},
  year = {1998}
}
@inproceedings{dignum98investigation,
  abstract = {In this paper we consider the notion of ought-to-do obligation in the context of several concepts of time. Starting from the relatively easy case of discrete time and a lockstep interpretation of actions, we experiment with several plausible definitions and propose a generalized notion of obligation for dense time. A crucial ingredient of the definition proposed is to consider a branching-time temporal operator in order to capture the obligation to a choice of actions adequately.},
  author = {Frank Dignum and R. Kuiper and {\text{J.-J. Ch}} Meyer},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:55:19 +0200},
  date-modified = {2008-06-26 15:55:19 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {179--195},
  publisher = {Informal Proceedings},
  title = {An Investigation into Deontics of Durative Actions},
  year = {1998}
}
@inproceedings{cholvy98reasoning,
  abstract = {It often happens that several different regulations apply to a given organization. And sometimes, these regulations are conflicting, that is, for instance, one regulation says that it is forbidden to do some action while another says it is permitted to do the same action. In this paper, we present a logic, called FUSION, to reason when several regulations are merged together. Our approach is to solve the conflicts by giving an order of priority between the regulations to be merged. We present the axiomatics and semantics of FUSION and prove some ``good" properties enforced by this logic.},
  author = {Laurence Cholvy and Frederic Cuppens},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:46:11 +0200},
  date-modified = {2008-06-26 15:46:11 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {161--178},
  publisher = {Informal Proceedings},
  title = {Reasoning about Norms Provided by Conflicting Regulations},
  year = {1998}
}
@inproceedings{brown98agents,
  abstract = {This paper investigates a species of multi-agent diachronic deontic logic, based on models with branched time, in which branches, rather than moments are taken as basics. With such models, supplemented by a set of agents, a choice function to model their agency, and an obligation function to induce normative features, we can develop a rich language for describing and analyzing the interrelationships over time between commitments, actions, and abilities.},
  author = {Mark A. Brown},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:41:24 +0200},
  date-modified = {2008-06-26 15:41:24 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {143--160},
  publisher = {Informal Proceedings},
  title = {Agents with Changing and Conflicting Commitments: A Preliminary Study},
  year = {1998}
}
@inproceedings{lindahl98intermediate,
  abstract = {In legal theory, it is a well-known idea that an intermediary concept like ``ownership" ``couples" a set $C_1, \ldots, C_n$ of legal consequences ti a set $F_1, \ldots, F_p$ of legal grounds. In our paper we attempt to make the idea of a coupling between grounds and consequences more precise by formulating it as a relation holding between two condition lattices. When stating this, however, it is important to distinguish couplings from mere ``connections". ---We begin the main exposition by presenting a legal mini-system, where a structure of descriptive conditions is coupled to a structure of normative conditions and where an intermediate concept is used for coupling the two structures. Next, we present a different example where the set of grounds is ``open" and we have to deal with a family of coupled structures satisfying a legal requirement. In the following part, we introduce a more rigorous framework for conditions and lattices and develop the formal theory. In particular, we define and explain the notions of connection and coupling, as well as the relations ``narrower than" and ``wider than" between couplings. Finally, in our conclusion, we suggest that the idea of intermediate concepts can be further developed for elucidating important concepts outside the legal area.},
  author = {Lars Lindahl and Jan Odelstad},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:35:42 +0200},
  date-modified = {2008-06-26 16:33:42 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {309--329},
  publisher = {Informal Proceedings},
  title = {Intermediate Concepts as Couplings of Conceptual Structures},
  year = {1998}
}
@inproceedings{lazzer98some,
  abstract = {In this paper we review some aspects of the theory of defeasible conditionals that the late Carlos Alchourr\'on developed in the last years of his life. These include both philosophical intuitions and formal features of his theory. In particular, we discuss the concept of a contributory condition used by Alchourr\'on, his formalization of the notion of prima facie duty and the connection between his theory of defeasible conditionals and the AGM logic of theory change.},
  author = {Lazzer Sandra and Oller Carlos and Palau Gladys and Becher Veronica and Ferme Eduardo and Rodriguez Ricardo},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:31:45 +0200},
  date-modified = {2008-06-26 15:31:45 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {113--125},
  publisher = {Informal Proceedings},
  title = {Some observations on \text{Carlos Alchourr\'o n}'s Theory of Defeasible Conditionals},
  year = {1998}
}
@inproceedings{bartha98moral,
  abstract = {The paper argues that we can 'tame' standard deontic logic by narrowing our focus to a particular agent deliberating ar a particular moment. A semantics for obligations and conditional obligations is developed using the Horty/Belnap dstit-semantics together with a preference ordering on the possibilities available to an agent. It is argued that this semantics correctly models reasoning about contrary-to-duty obligations, inclusing a strengthened version of the Chisholm paradox. Defeasible obligations are interpreted as inducing a particular preference ordering, which in turn determines definite obligations for an agent.},
  author = {Paul Bartha},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:26:47 +0200},
  date-modified = {2008-06-26 15:26:47 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {93--111},
  publisher = {Informal Proceedings},
  title = {Moral Preference, contrary-to-duty obligation and defeasible oughts},
  year = {1998}
}
@inproceedings{artosi98tableau,
  abstract = {In this paper we present a theorem proving methodology for a restricted but significant fragment of the conditional language made up of (boolean combinations of) conditional statements with unnested antecedents. The method is based on the possible world semantics for conditional logics. The label formalism introduced in [AG94,ABGR96] to account for the semantics of normal modal logics is easily adapted to the semantics of conditional logics by simply indexing labels with formulas. The inference rules are provided by the propositional system KE+ ---a tableau-like analytic proof system devised to be used both as a refutation and a direct method proof--- enlarged with suitable elimination rules for the conditional connective. The theorem proving methodology we are going to present can be viewed as a first step towards developing appropriate algorithmic framework for several conditional logics for (defeasible) conditional obligation.},
  author = {Alberto Artosi and Guido Governatori},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-26 15:22:45 +0200},
  date-modified = {2008-06-26 15:22:45 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {75--91},
  publisher = {Informal Proceedings},
  title = {A Tableau Methodology for Deontic Conditional Logics},
  year = {1998}
}
@inproceedings{makinson98on,
  abstract = {The usual presentations of deontic logic, whether axiomatic or semantic, treat norms as if they could bear truth-values. A fundamental problem of deontic logic, we believe, is to reconstruct it in accord with the philosophical position that norms direct rather than describe, and are neither true nor false. Alchourr\'o n and Bulygin 1981 have indeed made such a construction, refining an earlier one of Stenius 1963, based on the distinction between a norm and a proposition about norms. However it has the limitation that it does not deal with conditional norms. These are covered by an extension of Alchourr\'o n 1993, but with certain shortcomings. Our purpose is to extend the basic 1981 construction in another manner which, we suggest, provides a more satisfactory and sensitive analysis of conditional norms within the same philosophical perspective.The approach takes seriously the warning: no logic of norms without attention to a system of which they form a part. It is based on the notion of the iterative development of output of an explicitly presented normative code, under a given condition. It is neither axiomatic in style nor formulated in terms of a semantics of  ``possible worlds". It develops output by repeated detachment rather than by consequence (so as not to lose the directionality of conditional norms), and it distinguishes between gross and net output (so as to deal adequately with conditions that are ``contrary-to-duty"). The investigation also provides new perspectives on some well known problems. In particular, it throws light on the way in which explicit obligations may have a part in generating permissions, and how explicit permissions may limit obligations. It also helps pin down a distinction between ``substantive" and ``technical" defeasibility of conditional norms.},
  author = {Davide Makinson},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-25 18:06:51 +0200},
  date-modified = {2008-06-25 18:06:51 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  note = {Invited lecture},
  organization = {University of Bologna},
  pages = {3--42},
  publisher = {Informal Proceedings},
  title = {On a Fundamental Problem of Deontic Logic},
  year = {1998}
}
@inproceedings{bell98dynamic,
  abstract = {In this paper we introduce and formalize dynamic obligation hierarchies. We begin with a formal definition of obligations. In particular, we require that an agent's obligations are coherent; that is, that each obligation is jointly realisable with all of the obligations which are at least as important. This an agent's obligations form a hierarchy, and new obligations are defined with reference to it. We then show how preferential entailment can be used to formalize the revision of obligations and obligation hierarchies.},
  author = {John Bell and Zhisheng Huang},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-25 18:05:10 +0200},
  date-modified = {2008-06-26 15:35:21 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  pages = {127--141},
  publisher = {Informal Proceedings},
  title = {Dynamic Obligation Hierarchies},
  year = {1998}
}
@inproceedings{wright98deontic,
  abstract = {No abstract given.},
  author = {Georg H. von Wright},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-25 18:03:35 +0200},
  date-modified = {2008-06-25 18:06:00 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  note = {Invited lecture},
  organization = {University of Bologna},
  pages = {61--72},
  publisher = {Informal Proceedings},
  title = {Deontic Logic---as I see it},
  year = {1998}
}
@inproceedings{pizzi98iterated,
  abstract = {No abstract given.},
  author = {Claudio Pizzi},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-25 17:56:03 +0200},
  date-modified = {2008-06-25 18:04:49 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  note = {Invited lecture},
  organization = {University of Bologna},
  pages = {45--60},
  publisher = {Informal Proceedings},
  title = {Iterated Conditionals and Causal Imputation},
  year = {1998}
}
@proceedings{deon98,
  date-added = {2008-06-25 17:44:48 +0200},
  date-modified = {2008-06-25 17:55:49 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  organization = {University of Bologna},
  publisher = {Informal Proceedings},
  title = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  year = {1998}
}
@inproceedings{nute98norms,
  abstract = {There are at least three good reasons to try to develop a defeasible version of normative reasoning. First, many norms are prima facie, binding only if they are not overriden by more compelling norms. Second, norms in one system may take precedence over norms in another system, as the principles lex superior and lex posterior require. Third, otherwise attractive principles of normative reasoning often combine to give counterintuitive results unless some method can be developed for repressing some of these principles in troublesome cases.},
  author = {Donald Nute},
  booktitle = {Proceedings of the 4th International Workshop on Deontic Logic in Computer Science (DEON 1998), Bologna, Italy, January 8-10, 1998},
  date-added = {2008-06-25 17:40:34 +0200},
  date-modified = {2008-06-25 17:58:49 +0200},
  editor = {Paul McNamara and Henri Prakken},
  keywords = {deon98},
  note = {Invited lecture},
  organization = {University of Bologna},
  pages = {43},
  publisher = {Informal Proceedings},
  title = {Norms, Priorities, and Defeasibility: Abstract},
  year = {1998}
}

This file was generated by bibtex2html 1.96.