Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version

VERÓNICA BECHER

LECTURE NOTES IN COMPUTER SCIENCE

Springer

Año: 1995 vol. 991 p. 49 - 58

0302-9743

We compare two conditional logics for defeasible inference: Alchourr´on’s defeasible logic DFT and Boutilier’s CO logic. The two logics share the distinguishable characteristics common to most logics for defeasible inference. Namely, their conditional connective defeat the rules of Modus Ponens, Strengthening the Antecedent, Transitivity, and Contraposition. Although both logics have possible worlds semantics, Boutilier’s is relational while Alchourr´on’s is non-relational. In this note we reveal the connection between the two, concluding that the conditional sentences validated by both logics are precisely the same.