Some completeness results for stoppered and ranked classical preferential models

被引：7
作者：
Schlechta, K [1 ]
机构：
[1] CMI,LAB INFORMAT MARSEILLE,URA CNRS 1787,F-13453 MARSEILLE 13,FRANCE
来源：
JOURNAL OF LOGIC AND COMPUTATION | 1996年 / 6卷 / 04期
关键词：
non-monotonic reasoning; defeasible reasoning; preferential models;
D O I：
10.1093/logcom/6.4.599
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 arbitrary logics defined by preferential structures.
引用
收藏
页码：599 / 622
页数：24
相关论文
共 24 条
[1]   SATURATION, NONMONOTONIC REASONING AND THE CLOSED-WORLD ASSUMPTION [J].
BOSSU, G ;
SIEGEL, P .
ARTIFICIAL INTELLIGENCE, 1985, 25 (01) :13-63
[2]  
BOUTILIER C, AAAI 1990 BOSTON, P594
[3]  
BOUTILIER C, 1990, KRRTR904 TOR U
[4]  
BOUTILIER C, 1992, 921 TR U BRIT COL DE
[5]  
Freund M., 1994, Studia Logica, V53, P161, DOI 10.1007/BF01054708
[6]  
FREUND M, 1993, B IGPL, V1, P23
[7]  
Gabbay Dov., 1985, Proceedings NATO Advance Study Institute on Logics and Models of Concurrent Systems, P439
[8]   NONMONOTONIC INFERENCE BASED ON EXPECTATIONS [J].
GARDENFORS, P ;
MAKINSON, D .
ARTIFICIAL INTELLIGENCE, 1994, 65 (02) :197-245
[9]  
HANSSON B, 1971, NOUS, V3, P373
[10]  
Kaluzhny Y., 1995, Journal of Logic and Computation, V5, P111, DOI 10.1093/logcom/5.1.111
123