Generalized Satisfiability for the Description Logic ALC

Details Generalized Satisfiability for the Description Logic ALC Generalized Satisfiability for the Description Logic ALC

2011-03-04

arxiv.org/abs/1103.0853v1

Computer Science

Logic in Computer Science

Technical Report with complete Proofs, Conference Version appeared in TAMC2011

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 families, have an easier satisfiability problem; sometimes it is even tractable. We classify the complexity of the standard satisfiability problems for all possible Boolean and quantifier fragments of ALC in the presence of general axioms.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320494