Propositional default logics made easier: computational complexity of model checking-Reference-Cited by-同舟云学术

Propositional default logics made easier: computational complexity of model checking

Published:2002-10 Issue:1 Volume:289 Page:591-627
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Baumgartner Robert,Gottlob Georg

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference26 articles.

1. R. Baumgartner, G. Gottlob, On the complexity of model checking for propositional default logics: new results and tractable cases, Proc. of IJCAI-99, 1999, pp. 64–69.

2. R. Baumgartner, Contributions to the complexity analysis of non-monotonic reasoning, DBAI Technical Report DBAI-TR-2000-40.

3. A survey on complexity results for non-monotonic logics;Cadoli;J. Logic Programming,1993

4. E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of logic programming, Proc. of 12th IEEE, 1997.

5. On the computational cost of disjunctive logic programming: propositional case;Eiter;Ann. Math. Artif. Intell.,1995

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

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

2. Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic;Axioms;2020-07-21

3. On the complexity of extension checking in default logic;Information Processing Letters;2006-04

4. The complexity of model checking for propositional default logics;Data & Knowledge Engineering;2005-11

5. Seminormalizing a default theory;Journal of Applied Non-Classical Logics;2005-01