Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI

Details Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI

2011-06-12

arxiv.org/abs/1106.2305v1

Computer Science

Logic in Computer Science

a long version of a paper accepted for ICCCI'2011, 27 pages

Scientific paper

We give the first cut-free ExpTime (optimal) tableau decision procedure for
checking satisfiability of a knowledge base in the description logic SHI, which
extends the description logic ALC with transitive roles, inverse roles and role
hierarchies.

Affiliated with

Also associated with

No associations

Rating

Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI 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 Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-712469