Some completeness results for stoppered and ranked classical preferential models

Journal of Logic and Computation

Volumn 6, Issue 4, 1996, Pages 599-622

  Schlechta, Karl ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

Defeasible reasoning; Non monotonic reasoning; Preferential models

Indexed keywords

EID: 0040686370     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/6.4.599     Document Type: Article

References (26)

1. C. Boutilier. Conditional Logics of Normality as Modal Systems. AAAI 1990, Boston, p. 594.
2. C. Boutilier. Viewing conditional logics of normality as extensions of the modal system S4. Toronto University, KRR-TR-90-4, June 1990.
3. C. Boutilier. Conditional logics for default reasoning and belief revision. Department of Computer Science, University of British Columbia, Vancouver, Canada, TR 92-1, January 1992.
4. G. Bossu and P. Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25, 13-63, 1985.
5. M. Freund and D. Lehmann. Nonmonotonic inference operations. Bulletin of the IGPL, 1, 23-68, 1993.
6. M. Freund and D. Lehmann. Nonmonotonic reasoning: from finitary relations to infinitary inference operations. Studia Logica, 53, 161-201, 1994.
7. D. M. Gabbay. Theoretical foundations for non-monotonic reasoning in expert systems. In Logics and Models of Concurrent Systems, K. R. Apt, ed. pp. 439-457. Springer, Berlin, 1985.
8. P. Gärdenfors and D. Makinson. Nonmonotonic inference based on expectations. Artifical Intelligence, 65, 197-245, 1994.
9. B. Hansson. An analysis of some deontic logics. Nous, 3, 373-398. Reprinted in Deontic Logic: Introductory and Systematic Readings, R. Hilpinen, ed. pp. 121-147. Reidel, Dordrecht 1971.
10. B. Hansson. An analysis of some deontic logics. Nous, 3, 373-398. Reprinted in Deontic Logic: Introductory and Systematic Readings, R. Hilpinen, ed. pp. 121-147. Reidel, Dordrecht 1971.
11. Y. Kaluzhny and D. Lehmann. Deductive nonmonotonic inference operations: antitonic representations. Journal of Logic and Computation, 5, 111-122, 1995.
12. S. Kraus, D. Lehmann and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44, 167-207, 1990.
13. D. Lehmann. Plausibility logic. In Proceedings of Computer Science Logic '91, E. Boerger, G. Jäger, H. Kleine-Bu'üning and M. M. Richter, eds. pp. 227-241. Vol 626 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
14. D. Lehmann. Plausibility logic. Technical Report TR-92-3, Hebrew University, Jerusalem 91904, Israel, 1992.
15. D. Lehmann and M. Magidor. What does a conditional knowledge base entail? Artificial Intelligence, 55, 1-60, 1992.
16. D. Makinson. Five faces of minimality. Studia Logica, 52, 339-379, 1993.
17. D. Makinson. General patterns in nonmonotonic reasoning. In Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. III: Nonmonotonic and Uncertain Reasoning, D. Gabbay, C. Hogger and J. A. Robinson, eds. pp. 35-110. Oxford University Press, 1994.
18. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13, 81-132, 1980
19. K. Schlechta. Defaults as generalized quantifiers. Journal of Logic and Computation, 5, 473-494, 1995.
20. K. Schlechta. Some results on classical preferential models. Journal of Logic and Computation, 2, 675-686, 1992.
21. K. Schlechta. Preferential choice representation theorems for branching time structures. Journal of Logic and Computation, 5, 783-800, 1995.
22. K. Schlechta. Limit preferential models. Research Report RR 6, 03/94, Laboratoire d'Informatique de Marseille, URA CNRS 1787, 39 Rue Joliot-Curie, F-13453 Marseille Cedex 13, France.
23. K. Schlechta. Completeness and incompleteness for plausibility logic. Research Report RR 7, 04/94, Laboratoire d'Informatique de Marseille, URA CNRS 1787, 39, Rue Joliot-Curie, F-13453 Marseille Cedex 13, France, to appear in Journal of Logic, Language and Information, 1994.
24. K. Schlechta. A two-stage approach to first order default reasoning. Research Report RR 7, 04/94, Laboratoire d'Informatique de Marseille, URA CNRS 1787, 39 Rue Joliot-Curie, F-13453 Marseille Cedex 13, France. Also submitted to Fundamenta Informaticae, 1994.
25. Y. Shoham. A semantical approach to nonmonotonic logics. In Proceedings of Logics in Computer Science. pp. 275-279, Ithaca, NY, 1987.
26. R. H. Thomason. Combinations of tense and modality. In Handbook of Philosophical Logic, Vol. II, D. Gabbay and F. Guenthner, eds. pp. 135-165. D. Reidel, Dordrecht, 1984.