A New Approach to Preferential Structures

Article type: Research Article

Authors: Schlechta, Karl | Gourmelen, Laurent | Motré, Stéphanie | Rolland, Olivier | Tahar, Bensalah

Affiliations: Laboratoire d'Informatique de Marseille, CMI, Technopôle de Château-Gombert, F-13453 Marseille Cedex 13, France. ks@gyptis.univ-mrs.fr http://www.cmi.univ-mrs.fr/~ks

Note: [] Address for correspondence: Laboratoire d'Informatique de Marseille, CMI, Technopôle de Château-Gombert, F-13453 Marseille Cedex 13, France

Abstract: This paper deals with some fundamental concepts and questions of preferential structures. Traditionally, a model for preferential reasoning is a strict partial order on the set of classical models of the language; in this article it will be a total order on the classical models. Instead of representing non-monotonic inference relations by individual partial orders, we represent them by sets of total orders. We thus stay close to the way completeness proofs are done in classical logic. Our new approach will also justify multiple copies (or labelling functions) present in most work on preferential structures. A representation result for the finite case is proven; for the infinite case it remains an open question.

DOI: 10.3233/FI-2000-423407

Journal: Fundamenta Informaticae, vol. 42, no. 3-4, pp. 391-410, 2000