Results 151 to 160 of about 306 (174)
Some of the next articles are maybe not open access.
Deontic logic without deontic operators
Theory and Decision, 1971The usual axioms and inference rules of deontic logic employ as a new primitive term an operator for ‘obligatory’ or for ‘permitted’. These axioms and inference rules are here derived from a language which instead of the operator contains a predicate ‘admissible’ defined on the set of state descriptions of an assertoric language.
openaire +2 more sources
Prohairetic Deontic Logic (PDL)
1998In this paper we introduce Prohairetic Deontic Logic (PDL), a preference-based dyadic deontic logic. An obligation 'α should be (done) if β is (done)' is true if (1) no ¬αλβ state is as preferable as an αλβ state and (2) the preferred β states are α states.
Leendert W. N. van der Torre +1 more
openaire +2 more sources
Deontic logics for prioritized imperatives
Artificial Intelligence and Law, 2006When a conflict of duties arises, a resolution is often sought by use of an ordering of priority or importance. This paper examines how such a conflict resolution works, compares mechanisms that have been proposed in the literature, and gives preference to one developed by Brewka and Nebel.
openaire +1 more source
Investigations into the application of deontic logic
1995This paper discusses the results of a study for representation of law. Starting point is a legal knowledge based system for the Dutch traffic law that treats permissions as specialized obligations. The results of this prototype system have been evaluated and were the subject for further study.
openaire +1 more source
2004
We use non-Kripkean quasi-matrix semantics for the formalization of the systems S 3d , S 3dp and S 3dq of deontic logic. The system S 3d is weaker than the standard logic SDL . The semantics for S 3dp represents combination of quasi-matrix semantics and the semantics of truth value gluts, which allows S 3dp to avoid deontic explosion O A ∧ O¬A ⊃ O B ...
openaire +1 more source
We use non-Kripkean quasi-matrix semantics for the formalization of the systems S 3d , S 3dp and S 3dq of deontic logic. The system S 3d is weaker than the standard logic SDL . The semantics for S 3dp represents combination of quasi-matrix semantics and the semantics of truth value gluts, which allows S 3dp to avoid deontic explosion O A ∧ O¬A ⊃ O B ...
openaire +1 more source
An analysis of Hansson's dyadic deontic logic
Journal of Philosophical Logic, 1975Wolfgang Spohn, Spohn Wolfgang
exaly

