The complexity of propositional implication-Reference-Cited by-同舟云学术

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

The complexity of propositional implication

Published:2009-08 Issue:18 Volume:109 Page:1071-1077
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Beyersdorff Olaf,Meier Arne,Thomas Michael,Vollmer Heribert

Publisher

Elsevier BV

Subject

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

Reference15 articles.

1. The complexity of generalized satisfiability for linear temporal logic;Bauland,2007

2. The complexity of reasoning for fragments of default logic;Beyersdorff,2009

3. Playing with Boolean blocks. Part I: Post's lattice with applications to complexity theory;Böhler;SIGACT News,2003

4. Structure and importance of logspace MOD-classes;Buntrock;Mathematical Systems Theory,1992

5. Constant depth reducibility;Chandra;SIAM Journal on Computing,1984

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

1. Strong Backdoors for Default Logic;ACM Transactions on Computational Logic;2024-06-17

2. Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework;ACM Transactions on Computational Logic;2023-05-10

3. Model Checking Algorithm for Repairing Inference between Conjunctive Forms;Computación y Sistemas;2022-03-30

4. An Unexpected Boolean Connective;Logica Universalis;2021-06-17

5. The Weight in Enumeration;Language and Automata Theory and Applications;2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP