The Complexity of Reasoning for Fragments of Default Logic-Reference-Cited by-同舟云学术

The Complexity of Reasoning for Fragments of Default Logic

Published:2009 Issue: Volume: Page:51-64
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Beyersdorff Olaf,Meier Arne,Thomas Michael,Vollmer Heribert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02777-2_7

Reference19 articles.

1. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. SIGACT News 34(4), 38–52 (2003)

2. Ben-Eliyahu-Zohary, R.: Yet some more complexity results for default logic. Artificial Intelligence 139(1), 1–20 (2002)

3. Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. ACM Computing Research Repository, arXiv:0811.0959v1 [cs.CC] (2008)

4. Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Logic 3(2), 226–278 (2002)

5. Lecture Notes in Computer Science;P. Chapdelaine,2007

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

1. On the applicability of Postʼs lattice;Information Processing Letters;2012-05

2. The Complexity of Reasoning for Fragments of Autoepistemic Logic;ACM Transactions on Computational Logic;2012-04

3. Complexity of logic-based argumentation in Post's framework;Argument & Computation;2011-09

4. Complexity Classifications for Propositional Abduction in Post's Framework;Journal of Logic and Computation;2011-07-07

5. The complexity of reasoning for fragments of default logic;Journal of Logic and Computation;2011-03-25