The Complexity of Reasoning for Fragments of Default Logic

Details The Complexity of Reasoning for Fragments of Default Logic The Complexity of Reasoning for Fragments of Default Logic

2008-08-28

arxiv.org/abs/0808.3884v4

Computer Science

Computational Complexity

Corrected version

Scientific paper

Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\SigmaPtwo$-complete, and the complexity of the credulous and skeptical reasoning problem as SigmaP2-complete, resp. PiP2-complete. Additionally, he investigated restrictions on the default rules, i.e., semi-normal default rules. Selman made in 1992 a similar approach with disjunction-free and unary default rules. In this paper we systematically restrict the set of allowed propositional connectives. We give a complete complexity classification for all sets of Boolean functions in the meaning of Post's lattice for all three common decision problems for propositional default logic. We show that the complexity is a hexachotomy (SigmaP2-, DeltaP2-, NP-, P-, NL-complete, trivial) for the extension existence problem, while for the credulous and skeptical reasoning problem we obtain similar classifications without trivial cases.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Reasoning for Fragments of Default 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 The Complexity of Reasoning for Fragments of Default Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Reasoning for Fragments of Default Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327211