Carsten Fuhs

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

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

Carsten Fuhs, Cynthia Kop: Polynomial Interpretations for Higher-Order Rewriting. RTA 2012: 176-192

Carsten Fuhs, Cynthia Kop: Polynomial Interpretations for Higher-Order Rewriting. CoRR abs/1203.5754 (2012)

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)

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-based termination analysis using monotonicity constraints over the integers. TPLP 11(4-5): 503-520 (2011)

Carsten Fuhs, Cynthia Kop: Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. FroCoS 2011: 147-162

Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl: Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167

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

Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp: Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS 2011: 189-204

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. CoRR abs/1107.5980 (2011)

Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp: Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232

Carsten Fuhs, Peter Schneider-Kamp: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. SAT 2010: 71-84

Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp: Optimal Base Encodings for Pseudo-Boolean Constraints. CoRR abs/1007.4935 (2010)

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

Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke: Proving Termination of Integer Term Rewriting. RTA 2009: 32-47

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

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

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125

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

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