The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

Details The Complexity of Satisfiability for Sub-Boolean Fragments of ALC The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

2010-01-24

arxiv.org/abs/1001.4255v6

Computer Science

Logic in Computer Science

17 pages, accepted (in short version) to Description Logic Workshop 2010

Scientific paper

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite family, have an easier satisfiability problem; sometimes it is even tractable. All these fragments restrict the use of Boolean operators in one way or another. We look at systematic and more general restrictions of the Boolean operators and establish the complexity of the concept satisfiability problem in the presence of axioms. We separate tractable from intractable cases.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696779