Decidability of SHI with Transitive Closure of Roles
暂无分享,去创建一个
[1] Maurizio Lenzerini,et al. What's in an Aggregate: Foundations for Description Logics with Tuples and Sets , 1995, IJCAI.
[2] I. Horrocks,et al. A Tableau Decision Procedure for $\mathcal{SHOIQ}$ , 2007, Journal of Automated Reasoning.
[3] Stephan Tobies,et al. The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics , 2011, ArXiv.
[4] Maurizio Lenzerini,et al. Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.
[5] Ulrike Sattler,et al. A Concept Language Extended with Different Kinds of Transitive Roles , 1996, KI.
[6] Ian Horrocks,et al. A Tableaux Decision Procedure for SHOIQ , 2005, IJCAI.
[7] Giuseppe De Giacomo,et al. Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL , 2000, Inf. Comput..
[8] Alfred V. Aho,et al. Universality of data retrieval languages , 1979, POPL.
[9] Franz Baader. Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.
[10] Ian Horrocks,et al. Practical Reasoning for Expressive Description Logics , 1999, LPAR.
[11] Frank Pfenning,et al. Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.
[12] Roy Dyckhoff. Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.
[13] Franz Baader,et al. Tableau Algorithms for Description Logics , 2000, TABLEAUX.