OXFORD UNIVERSITY COMPUTING LABORATORY

Christoph Haase: Publications

by date |  by title |  by type |  bibtex

[1]

Reachability in Succinct and Parametric One-Counter Automata

Christoph Haase et al.

In M. Bravetti, G. Zavattaro, editors, Proceedings of the 20th International Conference on Concurrency Theory (CONCUR09) Vol. 5710 of Lecture Notes in Computer Science, pages 369—383. Springer, September 2009.

[2]

Ideal Downward Refinement in the EL Description Logic

Jens Lehmann, Christoph Haase

In Proceedings of the 19th International Conference on Inductive Logic Programming (ILP09) Vol. xxxx of Lecture Notes in Artificial Intelligence. Springer, July 2009.

To appear.

[3]

Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes

Christoph Haase, Carsten Lutz

In Malik Ghallab et al. , editors, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI08) Vol. 178 of Frontiers in Artificial Intelligence and Applications, pages 25—29. IOS Press, July 2008.

[4]

Complexity of Subsumption in Extensions of EL

Christoph Haase

Master's Thesis. TU Dresden, August 2007.

Random Image
Random Image
Random Image