A note on the complexity of the satisfiability of modal Horn clauses-Reference-Cited by-同舟云学术

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

A note on the complexity of the satisfiability of modal Horn clauses

Published:1987-03 Issue:1 Volume:4 Page:1-10
ISSN:0743-1066
Container-title:The Journal of Logic Programming
language:en
Short-container-title:The Journal of Logic Programming

Author:

Del Cerro Luis Fariñas,Penttonen Martti

Publisher

Elsevier BV

Subject

Logic

Reference9 articles.

1. Symbolical Logic and Mechanical Theorem Proving;Chang,1973

2. The complexity of theorem proving procedures;Cook;Proceedings of the 3rd ACM Symposium on Theory of Computing,1971

3. Resolution Modal Logic. Automated Reasoning in Non-classical Logic;Fariñas del Cerro;Logique et Analyse,1985

4. Molog: A System That Extends Prolog with Modal Logic;Fariñas del Cerro;New Generation Computing,1986

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

1. On satisfiability problem in modal logic S5;Proceedings of the 35th Annual ACM Symposium on Applied Computing;2020-03-29

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

3. Computing Theory Prime Implicates in Modal Logic;Advances in Intelligent Systems and Computing;2018

4. A short biography of Luis Fariñas del Cerro;Journal of Applied Non-Classical Logics;2017-10-02

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP