The Complexity of Reasoning for Fragments of Default Logic

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer. The Complexity of Reasoning for Fragments of Default Logic. In Oliver Kullmann, editor, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Volume 5584 of Lecture Notes in Computer Science, pages 51-64, Springer, 2009. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.