Journal of Logic and Computation, Volume 11, Issue 1, pp. 71-83: Abstract.
Preferential Logics are X-logics
Lionel Forget1, Vincent Risch2, and Pierre Siegel3
1LIM - ESA CNRS 6077, Centre de Mathématiques et d'Informatique, 39, rue Joliot-Curie, 13453 Marseille Cedex 13 France. E-mail: firstname.lastname@example.org
This paper shows how to define nonmonotonic logics from any classical logics [lagran] and any set X of formulas of L. In this context, the nonmonotonic inference relation [vdash]X is defined by A [vdash]X B if every classical theorem of A [cup] B which is in X is a theorem of A. The properties of the relation [vdash]X are studied. We show, in particular, that the elementary properties (supraclassicity, or, left logical equivalence, cut, etc.) are verified for any X. Moreover, we prove that cumulativity is verified if the set of formulas of the language, which are not in X, is deductively closed. Then we prove a representation theorem, i.e. in the finite case every preferential nonmonotonic logic is an X -logic. We also study a particular form of the set X for general propositional circumscription.
Keywords: Nonmonotonic logic, preferential model approach, representation theorem, circumscription