Satisfiability and reasoning mechanism of terminological cycles in description logic $$ v\mathcal{L} $$
暂无分享,去创建一个
[1] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.
[2] SHIZhongzhi,et al. A logical foundation for the semantic Web , 2005 .
[3] Franz Baader,et al. How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.
[4] Volker Haarslev,et al. RACER System Description , 2001, IJCAR.
[5] Bernhard Nebel,et al. Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.
[6] Peter F. Patel-Schneider,et al. DLP System Description , 1998, Description Logics.
[7] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[8] Ian Horrocks,et al. FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.
[9] Shi Zhongzhi,et al. A logical foundation for the semantic Web , 2005 .
[10] Franz Baader,et al. Using automata theory for characterizing the semantics of terminological cycles , 1996, Annals of Mathematics and Artificial Intelligence.
[11] Werner Nutt,et al. A Refined Architecture for Terminological Systems: Terminology = Schema + Views , 1998, Artif. Intell..
[12] Bernhard Nebel,et al. Terminological Cycles: Semantics and Computational Properties , 1991, Principles of Semantic Networks.
[13] Yarden Katz,et al. Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..
[14] Maurizio Lenzerini,et al. A Uniform Framework for Concept Definitions in Description Logics , 1997, J. Artif. Intell. Res..