NONMONOTONIC REASONING AND MODAL LOGIC, FROM NEGATION AS FAILURE TO DEFAULT LOGIC

被引：0
作者：
BALBIANI, P
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 521卷
关键词：
NONMONOTONIC REASONING; LOGIC PROGRAMMING; MODAL LOGIC;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present a modal characterization of two well-known nonmonotonic formalisms : the negation as failure rule and default logic. The semantics of logic programming with the negation as failure rule is described through the definition of a modal completion. In modal logic K4, this completion characterizes provability in logic programming with respect to SLDNF-resolution while in modal logic Pr (the modal logic of provability) it characterizes unprovability in logic programs.
引用
收藏
页码：223 / 231
页数：9
相关论文
共 19 条
[1]  
[Anonymous], 1980, MODAL LOGIC INTRO
[2]  
Apt Krzysztof R, 1988, FDN DEDUCTIVE DATABA, P89, DOI [10.1016/B978-0-934613-40-8.50006-3, DOI 10.1016/B978-0-934613-40-8.50006-3]
[3]  
BALBANI P, 1991, IN PRESS 8TH S THEOR
[4]  
BALBIANI P, 1991, THESIS U P SABATIER
[5]  
Besnard P., 1989, INTRO DEFAULT LOGIC
[6]  
BIDOIT N, 1988, P EUROPEAN C ARTIFIC, P492
[7]  
Boolos George, 1979, UNPROVABILITY CONSIS
[8]  
Clark K. L., 1978, Logic and data bases, P293
[9]  
Fitting M., 1985, Journal of Logic Programming, V2, P295, DOI 10.1016/S0743-1066(85)80005-4
[10]  
GELFOND M, 1987, 6TH P NAT C ART INT
12