A tableaux methodology for deontic conditional logics
作者： Alberto Artosi , Guido Governatori
DOI:
关键词:
摘要: In this paper we present a theorem proving methodology for restricted but significant fragment of the conditional language made up (boolean combinations of) statements with unnested antecedents. The method is based on possible world semantics logics. KEM label formalism, designed to account normal modal logics, easily adapted logics by simply indexing labels formulas. inference rules are provided propositional system $KE^{+}$ --- tableau-like analytic proof devised be used both as refutation and direct enlarged suitable elimination connective. going can viewed first step towards developing an appropriate algorithmic framework several (defeasible) obligation.
uq.edu.au参考文章(27)
Donald Nute, Topics in Conditional Logic ,(1980)
John Bell, The logic of nonmonotonicity Artificial Intelligence. ,vol. 41, pp. 365- 374 ,(1990) , 10.1016/0004-3702(90)90048-5
Carlos E. Alchourrón, Defeasible logics: demarcation and affinities Conditionals. pp. 67- 102 ,(1996)
Philippe Lamarre, S4 as the conditional logic of nonmonotonicity principles of knowledge representation and reasoning. pp. 357- 367 ,(1991)
Deontic Logic, Agency and Normative Systems Springer London. ,(1996) , 10.1007/978-1-4471-1488-8
L. Thorne McCarty, Defeasible Deontic Reasoning Fundamenta Informaticae. ,vol. 21, pp. 125- 148 ,(1994) , 10.3233/FI-1994-21128
L. Giordano, A. Martelli, M. L. Sapino, An Abductive Proof Procedure for Conditional Logic Programming FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning. pp. 231- 245 ,(1996) , 10.1007/3-540-61313-7_76
Raymond M. Smullyan, First-Order Logic ,(1968)
Alberto Artosi, Paola Benassi, Guido Governatori, Antonino Rotolo, Labelled Proofs for Quantified Modal Logic JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence. pp. 70- 86 ,(1996) , 10.1007/3-540-61630-6_5
Guido Governatori, Un Modello Formale Per Il Ragionamento Giuridico ,(1997)