- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j9 |      | Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reasoning 49(1): 53-93 (2012) |
| c32 | | Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs: Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. LOPSTR 2012: 1 |
| c31 | | Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. PPDP 2012: 1-12 |
| 2011 | ||
| j8 | | Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski: Proving Termination by Dependency Pairs and Inductive Theorem Proving. J. Autom. Reasoning 47(2): 133-160 (2011) |
| j7 | | Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann: Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7 (2011) |
| j6 | | Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp: Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. TPLP 11(1): 33-63 (2011) |
| c30 | | Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs: A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. LOPSTR 2011: 237-252 |
| c29 | | Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp: Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS 2011: 189-204 |
| e1 |  | Peter Schneider-Kamp, Michael Hanus (Eds.): Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 20-22, 2011, Odense, Denmark. ACM 2011, isbn 978-1-4503-0776-5 |
| 2010 | ||
| j5 | | Peter Schneider-Kamp: Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving. KI 24(1): 79-81 (2010) |
| j4 | | Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann: Automated termination analysis for logic programs with cut. TPLP 10(4-6): 365-381 (2010) |
| c28 | | Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR 2010: 184-199 |
| c27 | | Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp: Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 |
| c26 | | Carsten Fuhs, Peter Schneider-Kamp: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. SAT 2010: 71-84 |
| c25 | | René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp: Loops under Strategies ... Continued. IWS 2010: 51-65 |
| i5 | | Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs with Cut. CoRR abs/1007.4908 (2010) |
| i4 | | Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp: Optimal Base Encodings for Pseudo-Boolean Constraints. CoRR abs/1007.4935 (2010) |
| 2009 | ||
| j3 | | Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1) (2009) |
| c24 | | Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp: Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338 |
| c23 | | Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen: The Dependency Triple Framework for Termination of Logic Programs. LOPSTR 2009: 37-51 |
| c22 | | Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke: Proving Termination of Integer Term Rewriting. RTA 2009: 32-47 |
| i3 | | Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp: Polytool: polynomial interpretations as a basis for termination analysis of Logic programs. CoRR abs/0912.4360 (2009) |
| 2008 | ||
| b1 | | Peter Schneider-Kamp: Static termination analysis for prolog using term rewriting and SAT solving. RWTH Aachen University 2008, isbn kart., pp. 1-174 |
| j2 | | René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp: Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) |
| c21 | | Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp: Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus 2008: 109-124 |
| c20 | | Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann: Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651 |
| c19 | | Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125 |
| c18 | | |
| i2 | | Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Proofs for Logic Programs by Term Rewriting. CoRR abs/0803.0014 (2008) |
| 2007 | ||
| c17 | | Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459 |
| c16 | | Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik: Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures 2007 |
| c15 | | Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl: Implementing RPO and POLO using SAT. Deduction and Decision Procedures 2007 |
| c14 | | René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007 |
| c13 | | Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl: Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282 |
| c12 | | Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye: Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR 2007: 8-22 |
| c11 | | Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 |
| 2006 | ||
| j1 | | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning 37(3): 155-203 (2006) |
| c10 | | Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286 |
| c9 | | Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193 |
| c8 | | Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. LPAR 2006: 30-44 |
| c7 | | Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312 |
| i1 | | Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006) |
| 2005 | ||
| c6 | | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005 |
| c5 | | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination of Higher-Order Functions. FroCoS 2005: 216-231 |
| 2004 | ||
| c4 | | René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90 |
| c3 | | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331 |
| c2 | | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Automated Termination Proofs with AProVE. RTA 2004: 210-220 |
| 2003 | ||
| c1 | | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Improving Dependency Pairs. LPAR 2003: 167-182 |
Data released under the ODC-BY 1.0 license — See also our legal information page