( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity of Subsumption in the Escr Lscr Family of Description Logics: Acyclic and Cyclic TBoxes.

, и . ECAI, том 178 из Frontiers in Artificial Intelligence and Applications, стр. 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.

Christoph Haase

Christoph Haase

Christoph Haase

Christoph Haase

Christoph Haase

 

Другие публикации лиц с тем же именем

Approaching Arithmetic Theories with Finite-State Automata.. LATA, том 12038 из Lecture Notes in Computer Science, стр. 33-43. Springer, (2020)On the Expressiveness of Büchi Arithmetic., и . CoRR, (2020)The Reachability Problem for Two-Dimensional Vector Addition Systems with States., , , , , , , и . J. ACM, 68 (5): 34:1-34:43 (2021)Complexity of Subsumption in the Escr Lscr Family of Description Logics: Acyclic and Cyclic TBoxes., и . ECAI, том 178 из Frontiers in Artificial Intelligence and Applications, стр. 25-29. IOS Press, (2008)On the Power of Ordering in Linear Arithmetic Theories., и . ICALP, том 168 из LIPIcs, стр. 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Geometric decision procedures and the VC dimension of linear arithmetic theories., , и . LICS, стр. 59:1-59:13. ACM, (2022)Semënov Arithmetic, Affine VASS, and String Constraints., , и . STACS, том 289 из LIPIcs, стр. 29:1-29:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Directed Reachability for Infinite-State Systems., , и . CoRR, (2020)On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)., , и . MFCS, том 272 из LIPIcs, стр. 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Quantifier elimination for counting extensions of Presburger arithmetic., , и . FoSSaCS, том 13242 из Lecture Notes in Computer Science, стр. 225-243. Springer, (2022)