An extension of complex role inclusion axioms in the description logic SROIQ

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6173 LNAI, Issue , 2010, Pages 472-486

  Kazakov, Yevgeny ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX ROLES; COMPOSITIONAL PROPERTIES; DESCRIPTION LOGIC; POLYNOMIAL-TIME; REASONING PROBLEMS;

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SYNTACTICS;

AUTOMATA THEORY;

EID: 77955248901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14203-1_40     Document Type: Conference Paper

References (20)

1. Andrei, S., Chin, W.N., Cavadini, S.V.: Self-embedded context-free grammars with regular counterparts. Acta Inf. 40(5), 349-365 (2004) (Pubitemid 40877247)
2. Baader, F., Brandt, S., Lutz, C.: Pushing the ℰ ℒ envelope. In: Proc. IJCAI 05, pp. 364-369 (2005)
3. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)
4. Bachmair, L., Ganzinger, H.: Ordered chaining calculi for first-order theories of transitive relations. J. ACM 45(6), 1007-1049 (1998)
5. Baldoni, M.: Normal Multimodal Logics: Automatic Deduction and Logic Programming Extension. Ph.D. thesis, Università degli Studi di Torino (1998)
6. Fariñas del Cerro, L., Penttonen, M.: Grammar logics. Logique et Analyse 121-122, 123-134 (1988)
7. Chomsky, N.: On certain formal properties of grammars. Information and Control 2(2), 137-167 (1959)
8. Demri, S.: The complexity of regularity in grammar logics and related modal logics. J. Log. Comput. 11(6), 933-960 (2001)
9. Demri, S., de Nivelle, H.: Deciding regular grammar logics with converse through first-order logic. Journal of Logic, Language and Information 14(3), 289-329 (2005) (Pubitemid 41152229)
10. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
11. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: KR. pp. 57-67 (2006)
12. Horrocks, I., Sattler, U.: Decidability of SHIQ with complex role inclusion axioms. Artif. Intell. 160(1-2), 79-104 (2004)
13. Kazakov, Y.: RIQ and SROIQ are harder than SHOIQ. In: KR, pp. 274-284. AAAI Press, Menlo Park (2008)
14. Maurer, H., Salomaa, A., Wood, D.: Pure grammars. Information and Control 44(1), 47-72 (1980)
15. Nederhof, M.J.: Practical experiments with regular approximation of context-free languages. Computational Linguistics 26(1), 17-44 (2000)
16. Salomaa, A.: On sentential forms of context-free grammars. Acta Informatica 2(1), 40-49 (1973)
17. Schulz, S., Romacker, M., Hahn, U.: Part-whole reasoning in medical ontologies revisited: Introducing SEP triplets into classification-based description logics. In: Proc. of the 1998 AMIA Annual Fall Symposium, pp. 830-834. Hanley & Belfus (1998)
18. Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Course Technology (February 2005)
19. Suntisrivaraporn, B., Baader, F., Schulz, S., Spackman, K.A.: Replacing SEP-triplets in SNOMED CT using tractable description logic operators. In: Bellazzi, R., Abu-Hanna, A., Hunter, J. (eds.) AIME 2007. LNCS (LNAI), vol. 4594, pp. 287-291. Springer, Heidelberg (2007)
20. Wessel, M.: Obstacles on the way to qualitative spatial reasoning with description logics: Some undecidability results. In: Description Logics. CEURWorkshop Proceedings., vol. 49. CEUR-WS.org (2001)