THE COMPLEXITY OF MODEL CHECKING FOR CIRCUMSCRIPTIVE FORMULAS

被引：46
作者：
CADOLI, M
机构：
[1] Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, I-00198 Roma
来源：
INFORMATION PROCESSING LETTERS | 1992年 / 44卷 / 03期
关键词：
COMPUTATIONAL COMPLEXITY; CIRCUMSCRIPTION; PROPOSITIONAL LOGIC; SATISFIABILITY PROBLEMS; MODEL CHECKING;
D O I：
10.1016/0020-0190(92)90049-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：113 / 118
页数：6
相关论文
共 7 条
[1]  
EITER T, 1991, CDTR9120 TU WIEN C D
[2]   SOME COMPUTATIONAL ASPECTS OF CIRCUMSCRIPTION [J].
KOLAITIS, PG ;
PAPADIMITRIOU, CH .
JOURNAL OF THE ACM, 1990, 37 (01) :1-14
[3]  
Lifshitz V., 1985, P 9 INT JOINT C ARTI, P121
[4]   APPLICATIONS OF CIRCUMSCRIPTION TO FORMALIZING COMMONSENSE KNOWLEDGE [J].
MCCARTHY, J .
ARTIFICIAL INTELLIGENCE, 1986, 28 (01) :89-116
[5]   CIRCUMSCRIPTION - A FORM OF NON-MONOTONIC REASONING [J].
MCCARTHY, J .
ARTIFICIAL INTELLIGENCE, 1980, 13 (1-2) :27-39
[6]  
SCHAEFER TJ, 1978, 10 ANN ACM S THEOR C, P216
[7]  
SCHLIPF JS, 1988, 3RD P INT S METH INT, P485
1