THE COMPUTATIONAL-COMPLEXITY OF SATISFIABILITY OF TEMPORAL HORN FORMULAS IN PROPOSITIONAL LINEAR-TIME TEMPORAL LOGIC

被引：16

作者：

CHEN, CC

LIN, IP

机构：

[1] Department of Computer Science and Information Engineering, National Taiwan University, Taipei

来源：

关键词：

COMPUTATIONAL COMPLEXITY; TEMPORAL LOGIC; TEMPORAL HORN FORMULA; TEMPORAL LOGIC PROGRAMMING; SATISFIABILITY;

D O I：

10.1016/0020-0190(93)90014-Z

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：131 / 136

页数：6

共 9 条

[1]

ABADI M, 1987, 4TH P IEEE S LOG PRO, P4

[2]

BAUDINET M, 1988, STANCS881203 STANDF

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

DELCERRO, LF .

DELCERRO, LF ;

PENTTONEN, M .

JOURNAL OF LOGIC PROGRAMMING, 1987, 4 (01) :1-10

[5]

GABBAY D, 1987, TEMPORAL LOGIC THEIR

[6]

Hopcroft J. E., 1979, INTRO AUTOMATA THEOR

[7]

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

[8] CLAUSAL INTUITIONISTIC LOGIC .1. FIXED-POINT SEMANTICS [J].

MCCARTY, LT .

JOURNAL OF LOGIC PROGRAMMING, 1988, 5 (01) :1-31

[9] THE COMPLEXITY OF PROPOSITIONAL LINEAR TEMPORAL LOGICS [J].

SISTLA, AP ;

CLARKE, EM .