K. Schlechta CMI (Laboratoire d'Informatique de Marseille, URA CNRS 1787), F-13453 MarseilleCedex 13, France. Email: email@example.com
We extend earlier work to stoppered (or smooth) and ranked classical preferential models, giving several soundness and completeness results for these structures. In addition, we discuss the number of copies of models needed to represent arbitary logics defined by preferential structures.
: Non-monotonic reasoning, preferential models.
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Last updated 09 Sep 96
Part of the OUP Journals World Wide Web service.
Copyright Oxford University Press, 1996