The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic

Published:1993-03 Issue:3 Volume:45 Page:131-136
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Chen Cheng-Chia,Lin I-Peng

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Temporal logic programming;Abadi;Proc. 4th IEEE Symp. on Logic Programming,1987

2. On the semantics of temporal logic programming;Baudinet,1988

3. Molog: a system that extends Prolog with modal logic;Cerro;New Generation Comput.,1986

4. A note on the complexity of the satisfiability of modal Horn clauses;Cerro;J. Logic Programming,1987

5. Modal and temporal logic programming;Gabbay,1987

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LTL on Finite and Process Traces: Complexity Results and a Practical Reasoner;Journal of Artificial Intelligence Research;2018-11-23

2. Backdoors for Linear Temporal Logic;Algorithmica;2018-09-18

3. ON SUB-PROPOSITIONAL FRAGMENTS OF MODAL LOGIC;LOG METH COMPUT SCI;2018

4. Horn Fragments of the Halpern-Shoham Interval Temporal Logic;ACM Transactions on Computational Logic;2017-08-21

5. On the Complexity of Fragments of Horn Modal Logics;2016 23rd International Symposium on Temporal Representation and Reasoning (TIME);2016-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP