Author of the publication

Complexity of Subsumption in the Escr Lscr Family of Description Logics: Acyclic and Cyclic TBoxes.

, and . ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications, page 25-29. IOS Press, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Reachability Problem for Two-Dimensional Vector Addition Systems with States., , , , , , , and . J. ACM, 68 (5): 34:1-34:43 (2021)On the Expressiveness of Büchi Arithmetic., and . CoRR, (2020)On the Power of Ordering in Linear Arithmetic Theories., and . ICALP, volume 168 of LIPIcs, page 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Geometric decision procedures and the VC dimension of linear arithmetic theories., , and . LICS, page 59:1-59:13. ACM, (2022)Complexity of Subsumption in the Escr Lscr Family of Description Logics: Acyclic and Cyclic TBoxes., and . ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications, page 25-29. IOS Press, (2008)Approaching Arithmetic Theories with Finite-State Automata.. LATA, volume 12038 of Lecture Notes in Computer Science, page 33-43. Springer, (2020)Semënov Arithmetic, Affine VASS, and String Constraints., , and . STACS, volume 289 of LIPIcs, page 29:1-29:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests., and . LICS, page 1-14. IEEE, (2019)Ideal Downward Refinement in the EL Description Logic, and . University of Leipzig, (2009)Integer Programming with GCD Constraints., , , and . CoRR, (2023)