A NOTE ON THE COMPLEXITY OF THE SATISFIABILITY OF MODAL HORN CLAUSES

被引：15

作者：

DELCERRO, LF

PENTTONEN, M

机构：

[1] UNIV TOULOUSE 3,F-31062 TOULOUSE,FRANCE

[2] UNIV TURKU,DEPT COMP SCI,SF-20500 TURKU 50,FINLAND

来源：

JOURNAL OF LOGIC PROGRAMMING | 1987年 / 4卷 / 01期

关键词：

D O I：

10.1016/0743-1066(87)90018-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 10

页数：10

共 9 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2]

CHANG C, 1973, SYMBOLICAL LOGIC MEC

[3] MOLOG - A SYSTEM THAT EXTENDS PROLOG WITH MODAL LOGIC [J].

DELCERRO, LF .

[4]

DELCERRO LF, 1985, LOGIQUE ANAL

[5]

HUGHES GE, 1978, INTRO MODAL LOGIC

[6]

Jones N. D., 1976, Theoretical Computer Science, V3, P105, DOI 10.1016/0304-3975(76)90068-2

[7]

Kripke SA., 1963, MATH LOGIC QUART, V9, P67, DOI [DOI 10.1002/MALQ.19630090502, 10.1002/malq.19630090502]

[8]

Ladner R. E., 1977, SIAM Journal on Computing, V6, P467, DOI 10.1137/0206033

[9] A MACHINE-ORIENTED LOGIC BASED ON RESOLUTION PRINCIPLE [J].

ROBINSON, JA .