Propositional circumscription and extended closed-world reasoning are ΠP2-complete-Reference-Cited by-同舟云学术

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

Propositional circumscription and extended closed-world reasoning are ΠP2-complete

Published:1993-06 Issue:2 Volume:114 Page:231-245
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Eiter Thomas,Gottlob Georg

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference35 articles.

1. Polynomial terse sets;Amir;Inform. Comput.,1988

2. Introduction to logical programming;Apt,1987

3. Arithmetic classification of perfect models of stratified programs;Apt,1988

4. On the unique satisfiability problem;Blass;Inform. and Control,1982

5. The complexity of closed world reasoning and circumscription;Cadoli,1991

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

1. Graph-based construction of minimal models;Artificial Intelligence;2022-12

2. Choice logics and their computational properties;Artificial Intelligence;2022-10

3. The Complexity of Minimal Inference Problem for Conservative Constraint Languages;ACM Transactions on Computational Logic;2019-04-30

4. A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective;KI - Künstliche Intelligenz;2018-11-01

5. QBF as an Alternative to Courcelle’s Theorem;Theory and Applications of Satisfiability Testing – SAT 2018;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP