@techreport{HKOW10,
  title = "Reachability in Parametric One-Counter Automata",
  author = "Christoph Haase and Stephan Kreutzer and Joel Ouaknine and James Worrell",
  year = "2010",
  note = "Submitted.",
}
@inproceedings{HKOW-09concur,
  title = "Reachability in Succinct and Parametric One-Counter Automata",
  author = "Christoph Haase and Stephan Kreutzer and Joel Ouaknine and James Worrell",
  year = "2009",
  booktitle = "Proceedings of the 20th International Conference on Concurrency Theory (CONCUR09)",
  copyright = "Springer-Verlag",
  editor = "M. Bravetti and G. Zavattaro",
  location = "Bologna, Italy",
  month = "September",
  pages = "369--383",
  publisher = "Springer",
  series = "Lecture Notes in Computer Science",
  volume = "5710",
}
@inproceedings{LH-ilp09,
  title = "Ideal Downward Refinement in the EL Description Logic",
  author = "Jens Lehmann and Christoph Haase",
  year = "2009",
  booktitle = "Proceedings of the 19th International Conference on Inductive Logic Programming (ILP09)",
  copyright = "Springer-Verlag",
  location = "Leuven, Belgium",
  month = "July",
  note = "To appear",
  publisher = "Springer",
  series = "Lecture Notes in Artificial Intelligence",
  volume = "xxxx",
}
@conference{HL08-ecai,
  title = "Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes",
  author = "Christoph Haase and Carsten Lutz",
  year = "2008",
  booktitle = "Proceedings of the 18th European Conference on Artificial Intelligence ({ECAI08})",
  editor = "Malik Ghallab and Constantine D. Spyropoulos and Nikos Fakotakis and Nikos Avouris",
  location = "Patras, Greece",
  month = "July",
  pages = "25--29",
  publisher = "IOS Press",
  series = "Frontiers in Artificial Intelligence and Applications",
  volume = "178",
}
@mastersthesis{H07-msc,
  title = "Complexity of Subsumption in Extensions of EL",
  author = "Christoph Haase",
  year = "2007",
  month = "August",
  school = "TU Dresden",
  url = "http://web.comlab.ox.ac.uk//files/638/Haase-Msc-2007.pdf",
}