Computer Science – Logic in Computer Science
Scientific paper
2000-03-10
Deon'98. 4th International Workshop on Deontic Logic in Computer Science. CIRFID, Bologna, 1998, 75-91
Computer Science
Logic in Computer Science
17 pages
Scientific paper
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.
Artosi Alberto
Governatori Guido
No associations
LandOfFree
A tableau methodology for deontic conditional logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A tableau methodology for deontic conditional logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A tableau methodology for deontic conditional logics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-584015