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
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 45卷 / 03期
关键词：
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
相关论文
共 50 条
  • [1] On complexity of propositional Linear-time Temporal Logic with finitely many variables
    Rybakov, Mikhail
    Shkatov, Dmitry
    PROCEEDINGS OF THE ANNUAL CONFERENCE OF THE SOUTH AFRICAN INSTITUTE OF COMPUTER SCIENTISTS AND INFORMATION TECHNOLOGISTS (SAICSIT 2018), 2018, : 313 - 316
  • [2] THE COMPUTATIONAL-COMPLEXITY OF THE SATISFIABILITY OF MODAL HORN CLAUSES FOR MODAL PROPOSITIONAL LOGICS
    CHEN, CC
    LIN, IP
    THEORETICAL COMPUTER SCIENCE, 1994, 129 (01) : 95 - 121
  • [3] On the computational complexity of stratified negation in linear-time temporal logic programming
    Koutras, CD
    Nomikos, C
    INTENSIONAL PROGRAMMING II: BASED ON THE PAPERS AT ISLIP'99, 2000, : 106 - 116
  • [4] Automated natural deduction for propositional linear-time temporal logic
    Bolotov, Alexander
    Grigoriev, Oleg
    Shangin, Vasilyi
    TIME 2007: 14TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 2007, : 47 - +
  • [5] ON THE COMPUTATIONAL-COMPLEXITY OF SATISFIABILITY IN PROPOSITIONAL LOGICS OF PROGRAMS
    CHLEBUS, BS
    THEORETICAL COMPUTER SCIENCE, 1982, 21 (02) : 179 - 212
  • [6] The complexity of counting models of linear-time temporal logic
    Hazem Torfah
    Martin Zimmermann
    Acta Informatica, 2018, 55 : 191 - 212
  • [7] The Complexity of Linear-Time Temporal Logic Model Repair
    Tao, Xiuting
    Li, Guoqiang
    STRUCTURED OBJECT-ORIENTED FORMAL LANGUAGE AND METHOD, SOFL+MSVL 2017, 2018, 10795 : 69 - 87
  • [8] The complexity of counting models of linear-time temporal logic
    Torfah, Hazem
    Zimmermann, Martin
    ACTA INFORMATICA, 2018, 55 (03) : 191 - 212
  • [9] LINEAR-TIME ALGORITHMS FOR TESTING THE SATISFIABILITY OF PROPOSITIONAL HORN FORMULAE.
    Dowling, William F.
    Gallier, Jean H.
    Journal of Logic Programming, 1984, 1 (03): : 267 - 284
  • [10] The complexity of generalized satisfiability for linear temporal logic
    Bauland, Michael
    Schneider, Thomas
    Schnoor, Henning
    Schnoor, Ilka
    Vollmer, Heribert
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2007, 4423 : 48 - +
12345