You should be redirected automatically within 5 seconds. Should this fail for some reason, please manually go to my new home page.

Lehr- und Forschungsgebiet Informatik 2

Department of Computer Science

Dr. Peter Schneider-Kamp

Lehr- und Forschungsgebiet Informatik 2 RWTH Aachen D-52056 Aachen Germany E-mail: psk@informatik.rwth-aachen.de Phone: +49-241/80-21211 Fax: +49-241/80-22217 Room: 4208, Ahornstr. 55 home page: http://www.schneider-kamp.de

Current Activities & Memberships

• PC-Member of the 7th International Workshop on the Implementation of Logics (IWIL 2008), Doha, Qatar, November 2008
• Editor of the Department Of Computer Science Technical Reports of RWTH Aachen University, since September 2005
• member of the Association of Logic Programming
• member of the Association of Automated Reasoning
• founding member of the Python Software Foundation

Past Activities

• PC-Member of the 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2007), Kongens Lyngby, Denmark, August 2007
• Organizer of TeReSe meeting 2007/2, Aachen, November 2007
• Organizer of TeReSe meeting 2005/2, Aachen, November 2005

Research

I am a research assistant and PhD student at Lehr- und Forschungsgebiet Informatik 2. My fields of interest are:

• Automated Termination Analysis
  • Termination of Logic Programs
  • Termination of Term Rewriting
  • Development of the AProVE Tool
  • Termination of Functional Programs
• Reducing Search Problems to SAT
• Encoding LPO to SAT
• Encoding RPO to SAT
• Encoding POLO to SAT

Travels 2007, 2008 (click for map)

Teaching Activities

• Vorlesung Datenstrukturen und Algorithmen (SS 08)
• Proseminar Fortgeschrittene Programmierkonzepte in Java, Haskell und Prolog (SS 08)
• Seminar Verifikationsverfahren (SS 08)
• Vorlesung Informatik I - Programmierung (WS 07/08)
• Seminar Terminierungsanalyse (WS 07/08)
• Vorlesung Functional Programming (SS 07)
• Proseminar Fortgeschrittene Programmierkonzepte in Java, Haskell und Prolog (SS 07)
• Seminar Verifikationsverfahren (SS 07)
• Vorlesung Termersetzungssysteme (WS 06/07)
• Seminar Termersetzungssysteme - Aktuelle Themen und Erweiterungen (WS 06/07)
• Vorlesung Logikprogrammierung (SS 06)
• Proseminar Fortgeschrittene Programmierkonzepte in Java, Haskell und Prolog (SS 06)
• Seminar Verifikationsverfahren (SS 06)
• Vorlesung Informatik I - Programmierung (WS 05/06)
• Seminar Automatische Terminierungsanalyse (WS 05/06)
• Vorlesung Functional Programming (SS 05)
• Seminar Verifikationsverfahren (SS 05)
• Proseminar Fortgeschrittene Programmierkonzepte in Java, Haskell und Prolog (SS 05)
• Seminar Termersetzungssysteme - Aktuelle Themen und Erweiterungen (SS 04)
• Proseminar IT-Sicherheitskonzepte und Sicherheit in Java (SS 04)
• Vorlesung Informatik I - Programmierung (WS 03/04)
• Seminar Terminierungsanalyse (WS 03/04)

Selected Publications

Journals

• P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann
  Automated Termination Proofs for Logic Programs by Term Rewriting
  ACM Transactions on Computational Logic, to appear. © ACM Publishing
  
• R. Thiemann, H. Zantema, J. Giesl, and P. Schneider-Kamp
  Adding Constants to String Rewriting
  Applicable Algebra in Engineering, Communication and Computing, 19(1): 27-38, 2008. © Springer-Verlag
  Preliminary Version
• J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
  Mechanizing and Improving Dependency Pairs
  Journal of Automated Reasoning, 37(3): 155-203, 2006. © Springer-Verlag
  Preliminary Version

Conferences

• B. Alarcon, F. Emmes, C. Fuhs, J. Giesl, R. Gutierrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann
  Improving Context-Sensitive Dependency Pairs
  In Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '08), Doha, Qatar, Lecture Notes in Artificial Intelligence, 2008. To appear. ©Springer-Verlag
  
• C. Fuhs, R. Navarro, C. Otto, J. Giesl, S. Lucas, and P. Schneider-Kamp
  Search Techniques for Rational Polynomial Orders
  In Proceedings of the 9th International Conference on Artificial Intelligence and Symbolic Computation (AISC '08), Birmingham, UK, Lecture Notes in Artificial Intelligence 5144, pages 109-124, 2008. ©Springer-Verlag
  
• C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl
  Maximal Termination
  In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA '08), Hagenberg, Austria, Lecture Notes in Computer Science 5117, pages 110-125, 2008. ©Springer-Verlag
  Extended version appeared as Technical Report AIB-2008-03, RWTH Aachen, Germany.
  
• R. Thiemann, J. Giesl, P. Schneider-Kamp
  Deciding Innermost Loops
  In Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA '08), Hagenberg, Austria, Lecture Notes in Computer Science 5117, pages 366-380, 2008. ©Springer-Verlag
  
• M. T. Nguyen, J. Giesl, P. Schneider-Kamp, and D. De Schreye
  Termination Analysis of Logic Programs based on Dependency Graphs
  In Proceedings of the 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '07), Kongens Lyngby, Denmark, Lecture Notes in Computer Science 4915, pages 8-22, 2008. ©Springer-Verlag
  
• P. Schneider-Kamp, R. Thiemann, E. Annov, M. Codish, and J. Giesl
  Proving Termination using Recursive Path Orders and SAT Solving
  In Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS '07), Liverpool, UK, Lecture Notes in Artificial Intelligence 4720, pages 267-282, 2007. ©Springer-Verlag
  
• J. Giesl, R. Thiemann, S. Swiderski, and P. Schneider-Kamp
  Proving Termination by Bounded Increase
  In Proceedings of the 21st International Conference on Automated Deduction (CADE '07), Bremen, Germany, Lecture Note in Artificial Intelligence 4603, pages 443-459, 2007. ©Springer-Verlag
  Extended version appeared as Technical Report AIB-2007-03, RWTH Aachen, Germany.
  
• C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl
  SAT Solving for Termination Analysis with Polynomial Interpretations
  In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT '07), Lisbon, Portugal, Lecture Notes in Computer Science 4501, pages 340-354, 2007. ©Springer-Verlag
  
• M. Codish, P. Schneider-Kamp, V. Lagoon, R. Thiemann, and J. Giesl
  SAT Solving for Argument Filterings
  In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '06), Phnom Penh, Cambodia, Lecture Notes in Artificial Intelligence 4246, pages 30-44, 2006. © Springer-Verlag
  
• J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann
  Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
  In Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA-06), Seattle, USA, Lecture Notes in Computer Science 4098, pages 297-312, 2006. ©Springer-Verlag
  
• P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann
  Automated Termination Analysis for Logic Programs by Term Rewriting
  In Proceedings of the 16th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '06), Venice, Italy, Lecture Notes in Computer Science 4407, pages 177-193, 2007. ©Springer-Verlag
  
• J. Giesl, P. Schneider-Kamp, and R. Thiemann
  AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
  In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR '06), Seattle, USA, Lecture Notes in Artificial Intelligence 4130, pages 281-286, 2006. ©Springer-Verlag
  
• J. Giesl, R. Thiemann, and P. Schneider-Kamp
  Proving and Disproving Termination of Higher-Order Functions
  In Proceedings of the 5th International Workshop on Frontiers of Combining Systems (FroCoS '05), Vienna, Austria, Lecture Notes in Artificial Intelligence 3717, pages 216-231, 2005. © Springer-Verlag
  
• J. Giesl, R. Thiemann, and P. Schneider-Kamp
  The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
  In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '04), Montevideo, Uruguay, Lecture Notes in Artificial Intelligence 3452, pages 301-331, 2005. © Springer-Verlag
  
• R. Thiemann, J. Giesl, and P. Schneider-Kamp
  Improved Modular Termination Proofs Using Dependency Pairs
  In Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR '04), Cork, Ireland, Lecture Notes in Artificial Intelligence 3097, pages 75-90, 2004. © Springer-Verlag
  
• J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
  Automated Termination Proofs with AProVE
  In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA '04), Aachen, Germany, Lecture Notes in Computer Science 3091, pages 210-220, 2004. © Springer-Verlag
  
• J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
  Improving Dependency Pairs
  In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '03), Almaty, Kazakhstan, Lecture Notes in Artificial Intelligence 2850, pages 167-182, 2003. ©Springer-Verlag
  Extended version available as Technical Report AIB-2003-04, RWTH Aachen, Germany.

Miscellaneous

pub   1024D/790A1E1C 2004-11-08 [expires: 2009-11-07]
      Key fingerprint = F347 1A1C 1DFE 94C0 DA7A  DCD5 DD56 EB09 790A 1E1C
uid                  Peter Schneider-Kamp (NoWonder) <psk@informatik.rwth-aachen.de>
sub   2048g/68B9F2B4 2004-11-08 [expires: 2009-11-07]

Peter Schneider-Kamp

Last modified: Thu Oct 22nd 09:28:12 CEST 2003