Skip Navigation

Journal of Logic and Computation 1997 7(5):605-631; doi:10.1093/logcom/7.5.605
© 1997 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (13)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by BEZZAZI, H.
Right arrow Articles by PÉREZ, R. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Beyond Rational Monotony: Some Strong Non-Horn Rules for Nonmonotonic Inference Relations

HASSAN BEZZAZI1, DAVID MAKINSON2 and RAMÓN PINO PÉREZ3

1LIFL U.A. 369 du CNRS, Cité Scientifique, 59655 Villeneuve d'Ascq Cedex, France and Université de Lille II, Faculté de Droit 59000 Lille, France. E-mail: bezzazi{at}lifl.fr
2Les Etangs B2, La Ronce 92410 Ville d'Avray, France. E-mail: d.makinson{at}unesco.org
3LIFL U.A. 369 du CNRS, Cité Scientifique 59655 Villeneuve d'Ascq Cedex, France and Université de Lille I Eudil, 59655 Villeneuve d'Ascq, France. E-mail: pino{at}lifl.fr

Lehmann, Magidor and others have investigated the effects of adding the non-Horn rule of rational monotony to the rules for preferential inference in nonmonotonic reasoning. In particular, they have shown that every inference relation satisfying those rules is generated by some ranked preferential model. We explore the effects of adding a number of other non-Horn rules that are stronger than or incomparable with rational monotony, but which are still weaker than plain monotony. Distinguished among these is a rule of determinacy preservation, equivalent to one of rational transitivity, for which we establish a representation theorem in terms of quasi-linear preferential models. An important tool in the proof of the representation theorem is the following purely semantic result, implicit in work of Freund, but here established by a more direct argument: every ranked preferential model generates the same inference relation as some ranked preferential model that is collapsed, in the sense of being both injective and such that each of its states is minimal for some formula. We also consider certain other non-Horn rules which are incomparable with monotony but arc implied by conditional excluded middle, and establish a representation result for a central one among them, which we call fragmented disjunction, equivalent to fragmented conjunction, in terms of almost linear preferential models. Finally, we consider briefly some curious Horn rules beyond the preferential ones but weaker than monotony, notably those which we call conjunctive insistence and n-monotony.

Keywords: Nonmonotonic reasoning; rational monotony; preferential models


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
Z. Zhu and W. Xiao
Two Representation Theorems for Non-monotonic Inference Relations
J Logic Computation, August 6, 2007; (2007) exm020v1.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.