Logic for Programming, Artificial Intelligence, and Reasoning
From MaRDI portal
Publication:5705932
DOI10.1007/b106931zbMath1108.68477MaRDI QIDQ5705932
Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
Publication date: 10 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106931
68Q42: Grammars and rewriting systems
Related Items
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs, Termination Analysis by Dependency Pairs and Inductive Theorem Proving, Beyond Dependency Graphs, Certification of Proving Termination of Term Rewriting by Matrix Interpretations, Termination Analysis of Logic Programs Based on Dependency Graphs, Termination of Narrowing Using Dependency Pairs, Search Techniques for Rational Polynomial Orders, Monotonicity Criteria for Polynomial Interpretations over the Naturals, KBO orientability, Proving termination of context-sensitive rewriting by transformation, Mechanizing and improving dependency pairs, Matrix interpretations for proving termination of term rewriting, Loop detection in term rewriting using the eliminating unfoldings, Adding constants to string rewriting, Termination of narrowing via termination of rewriting, Context-sensitive dependency pairs, Match-bounds revisited, Increasing interpretations, Enhancing dependency pair method using strong computability in simply-typed term rewriting, Certification of Termination Proofs Using CeTA, Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures, Maximal Termination, Usable Rules for Context-Sensitive Rewrite Systems, Root-Labeling, Deciding Innermost Loops, Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems, The Computability Path Ordering: The End of a Quest, From Outermost Termination to Innermost Termination, Proving Termination of Integer Term Rewriting, Well-Definedness of Streams by Termination, Degrees of Undecidability in Term Rewriting
Uses Software
