Termination Analysis by Dependency Pairs and Inductive Theorem Proving

Automated Deduction – CADE-22 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02959-2_25 ◽

2009 ◽

pp. 322-338 ◽

Author(s):

Stephan Swiderski ◽

Michael Parting ◽

Jürgen Giesl ◽

Carsten Fuhs ◽

Peter Schneider-Kamp

Keyword(s):

Theorem Proving ◽

Termination Analysis ◽

Inductive Theorem Proving ◽

Dependency Pairs

Download Full-text

Proving Termination by Dependency Pairs and Inductive Theorem Proving

Journal of Automated Reasoning ◽

10.1007/s10817-010-9215-9 ◽

2011 ◽

Vol 47 (2) ◽

pp. 133-160 ◽

Author(s):

Carsten Fuhs ◽

Jürgen Giesl ◽

Michael Parting ◽

Peter Schneider-Kamp ◽

Stephan Swiderski

Keyword(s):

Theorem Proving ◽

Inductive Theorem Proving ◽

Dependency Pairs

Download Full-text

Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation

Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019 ◽

10.1145/3354166.3354178 ◽

2019 ◽

Author(s):

Kentaro Kikuchi ◽

Takahito Aoto ◽

Isao Sasano

Keyword(s):

Theorem Proving ◽

Program Transformation ◽

Rewriting Systems ◽

Inductive Theorem Proving

Download Full-text

Inductive theorem proving based on tree grammars

Annals of Pure and Applied Logic ◽

10.1016/j.apal.2015.01.002 ◽

2015 ◽

Vol 166 (6) ◽

pp. 665-700 ◽

Author(s):

Sebastian Eberhard ◽

Stefan Hetzl

Keyword(s):

Theorem Proving ◽

Inductive Theorem Proving

Download Full-text

Inductive Theorem Proving by Consistency for First-Order Clauses

TEUBNER-TEXTE zur Informatik - Informatik ◽

10.1007/978-3-322-95233-2_27 ◽

1992 ◽

pp. 441-461 ◽

Author(s):

Harald Ganzinger ◽

Jürgen Stuber

Keyword(s):

Theorem Proving ◽

First Order ◽

Inductive Theorem Proving

Download Full-text

Inductive theorem proving by consistency for first-order clauses

Conditional Term Rewriting Systems - Lecture Notes in Computer Science ◽

10.1007/3-540-56393-8_17 ◽

1993 ◽

pp. 226-241 ◽

Author(s):

Harald Ganzinger ◽

Jürgen Stuber

Keyword(s):

Theorem Proving ◽

First Order ◽

Inductive Theorem Proving

Download Full-text

PROLOG-based inductive theorem proving

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-16042-6_7 ◽

1985 ◽

pp. 129-149 ◽

Author(s):

Jieh Hsiang ◽

Mandayam Srivas

Keyword(s):

Theorem Proving ◽

Inductive Theorem Proving

Download Full-text

On the use of conditional rewrite rules in inductive theorem proving

Conditional Term Rewriting Systems - Lecture Notes in Computer Science ◽

10.1007/3-540-19242-5_5 ◽

1988 ◽

pp. 56-61

Author(s):

Laurent Fribourg

Keyword(s):

Theorem Proving ◽

Inductive Theorem Proving ◽

Download Full-text

A good class of tree automata. Application to inductive theorem proving

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/bfb0055071 ◽

1998 ◽

pp. 409-420 ◽

Author(s):

D. Lugiez

Keyword(s):

Theorem Proving ◽

Tree Automata ◽

Inductive Theorem Proving

Download Full-text

Matrix-Based Inductive Theorem Proving

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/10722086_24 ◽

2000 ◽

pp. 294-308 ◽

Author(s):

Christoph Kreitz ◽

Brigitte Pientka

Keyword(s):

Theorem Proving ◽

Inductive Theorem Proving

Download Full-text

Constructive matching — A methodology for inductive theorem proving

Lecture Notes in Computer Science - Logics in AI ◽

10.1007/bfb0018443 ◽

1991 ◽

pp. 212-226

Author(s):

Marta Fraňová

Keyword(s):

Theorem Proving ◽

Inductive Theorem Proving

Download Full-text