Skip Navigation

Journal of Logic and Computation 2000 10(4):573-581; doi:10.1093/logcom/10.4.573
© 2000 by Oxford University Press
This Article
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 Similar articles in ISI Web of Science
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 (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Schlechta, K
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Unrestricted preferential structures

K Schlechta

Laboratoire d'Informatique de Marseille, CNRS ESA 6077, CMI, Technopôle de Château-Gombert, F-13453 Marseille Cedex 13, France E-mail: ks@gyptis.univ-mrs.fr

One of the major open problems of preferential structures was perhaps to give an unrestricted representation result. We give a solution to the problem in this short, technical paper. Up to now - to the author's knowledge - all representation results for preferential structures were subject to some restriction: definability preservation (the author's terminology, fullness in Lehmann's terminology) or some kind of finiteness. The results presented here are valid without any restrictions.

Keywords: nonmonotonic logic, preferential models, definability, common sense reasoning


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




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.