Paper Info
Title
A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
Abstract
Abstract. Hybrid EL-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept def- initions, which are interpreted with greatest fixpoint (gfp) semantics. We introduce a proof-theoretic approach that yields a polynomial-time deci- sion procedure for subsumption in EL w.r.t. hybrid TBoxes, and present preliminary experimental results regarding the performance of the rea- soner Hyb that implements this decision procedure.
Year
Venue
Keywords
2008
Description Logics
polynomial time
Field
DocType
Citations 
Semantic reasoner,Computer science,Theoretical computer science,Artificial intelligence,Fixed point,Semantics
Conference
0
PageRank 
References 
Authors
0.34
9
3
Name
Order
Citations
PageRank
Franz Baader18123646.64
Novak Novakovik200.34
Boontawee Suntisrivaraporn338128.58