Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics

Details Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics

2011-04-14

arxiv.org/abs/1104.2825v1

Computer Science

Logic in Computer Science

Scientific paper

We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for deciding the existence of uniform interpolants, an approach to computing interpolants when they exist, and tight bounds on their size. We use a mix of model- theoretic and automata-theoretic methods that, as a by-product, also provides characterizations of and decision procedures for conservative extensions.

Affiliated with

Also associated with

No associations

Rating

Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics 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 Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167106