On the Parameterized Complexity of Default Logic and Autoepistemic Logic

Details On the Parameterized Complexity of Default Logic and Autoepistemic Logic On the Parameterized Complexity of Default Logic and Autoepistemic Logic

2011-10-04

arxiv.org/abs/1110.0623v2

Computer Science

Computational Complexity

12 pages + 2 pages appendix, 1 figure, Version without Appendix submitted to LATA 2012

Scientific paper

We investigate the application of Courcelle's Theorem and the logspace version of Elberfeld etal. in the context of the implication problem for propositional sets of formulae, the extension existence problem for default logic, as well as the expansion existence problem for autoepistemic logic and obtain fixed-parameter time and space efficient algorithms for these problems. On the other hand, we exhibit, for each of the above problems, families of instances of a very simple structure that, for a wide range of different parameterizations, do not have efficient fixed-parameter algorithms (even in the sense of the large class XPnu), unless P=NP.

Affiliated with

Also associated with

No associations

Rating

On the Parameterized Complexity of Default Logic and Autoepistemic Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Parameterized Complexity of Default Logic and Autoepistemic Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Parameterized Complexity of Default Logic and Autoepistemic Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267907