Publikationen

Stephan Kreutzer

2006

  • D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer. DAG-width and parity games. In Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006, vol. 3884 of LNCS, pp. 524–536. Springer, 2006.             
  • A. Dawar, E. Grädel, and S. Kreutzer. Backtracking Games and Inflationary Fixed Points. Theoretical Computer Science, vol. 350, pp. 174–187, 2006.                                 

2005

  • A. Blumensath and S. Kreutzer. An Extension to Muchnik's Theorem. Journal of Logic and Computation, vol. 15, pp. 59–74, 2005.             

2004

  • A. Dawar, E. Grädel, and S. Kreutzer. Inflationary fixed points in modal logic. ACM Transations on Computational Logic, vol. 5, pp. 282 – 315, 2004.             
  • A. Dawar, S. Kreutzer, and E. Grädel. Backtracking Games and Inflationary Fixed Points. In Proc. 31st International Colloquium on Automata, Languages and Programming – ICALP'04. Springer, 2004.             

2003

  • E. Grädel and S. Kreutzer. Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. In Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS), pp. 158 – 167, 2003.             
  • S. Kreutzer. Pure and Applied Fixed-Point Logics. In Ausgezeichnete Informatikdissertationen 2002 (D. Wagner et al., Eds.), vol. D-3 of Lecture Notes in Informatics – Dissertations, pp. 59–68. German Informatics Society, 2003.             

2002

  • A. Dawar and S. Kreutzer. Generalising Automaticity to Modal Properties of Finite Structures. In Foundations of Software Technology and Theoretical Computer Science, 2002.                                 
  • S. Kreutzer. Expressive Equivalence of Least and Inflationary Fixed-Point Logic. In Proceedings of the 17th IEEE Symp. on Logic in Computer Science (LICS), 2002.                                 
  • S. Kreutzer. Partial Fixed-Point Logic on Infinite Structures. In Annual Conference of the European Association for Computer Science Logic (CSL), vol. 2471 of Lecture Notes in Computer Science (LNCS). Springer, 2002.                                 
  • S. Kreutzer. Pure and Applied Fixed-Point Logics. PhD thesis, RWTH Aachen, 2002.             

2001

  • A. Dawar, E. Grädel, and S. Kreutzer. Inflationary Fixed Points in Modal Logic. In Proceedings of 15th Annual Conference of the European Association for Computer Science Logic CSL 2001, LNCS. Springer, 2001.                                 
  • S. Kreutzer. Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. In Proceedings of the 8th International Conference on Database Theory (ICDT), vol. 1973 of LNCS, pp. 248–262. Springer, 2001.                                 
  • S. Kreutzer. Operational Semantics for Fixed-Point Logics on Constraint Databases. In Proceedings of the 8th International Conference on Logic for Programming and Automated Reasoning, LPAR 2001, Havana, vol. 2250 of LNCS, pp. 465–479. Springer, 2001.                                 

2000

  • S. Kreutzer. Fixed-point Query Languages for Linear Constraint Databases. In Proceedings of the 19th ACM Symp. on Principles of Database Systems (PODS), 2000, pp. 116–125. ACM press, 2000.                                 

1999

  • E. Grädel and S. Kreutzer. Descriptive Complexity Theory for Constraint Databases. In Proceedings of the Annual Conference of the European Association for Computer Science Logic, CSL `99, Madrid, vol. 1683 of LNCS, pp. 67–81. Springer, 1999.                                 
  • S. Kreutzer. Descriptive Complexity Theory for Constraint Databases. Diploma thesis, RWTH-Aachen, 1999.