A tableaux methodology for deontic conditional logics

Artosi, Alberto and Governatori, Guido (1998). A tableaux methodology for deontic conditional logics. In: DEON'98, 4th International Workshop on Deontic Logic in Computer Science, Bologna, Italy, (65-81). January, 1998.

Author Artosi, Alberto
Governatori, Guido
Title of paper A tableaux methodology for deontic conditional logics
Conference name DEON'98, 4th International Workshop on Deontic Logic in Computer Science
Conference location Bologna, Italy
Conference dates January, 1998
Publication Year 1998
Sub-type Fully published paper
Start page 65
End page 81
Language eng
Abstract/Summary 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 KEM label formalism, designed 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 of 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 an appropriate algorithmic framework for several conditional logics for (defeasible) conditional obligation.
Keyword Deontic logic
Conditional logic
Labelled tableaux
Possible worlds semantics
Q-Index Code E1
Q-Index Status Provisional Code

 
Versions
Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Created: Tue, 15 Mar 2005, 10:00:00 EST by Guido Governatori on behalf of Scholarly Communication and Digitisation Service