Automated Termination Analysis for Logic Programs by Term Rewriting

DOI10.1007/978-3-540-71410-1_13zbMath1196.68036OpenAlexW1530752153MaRDI QIDQ3591084

Peter Schneider-Kamp, Alexander Serebrenik, Jürgen Giesl, René Thiemann

Publication date: 10 September 2007

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71410-1_13

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (9)

Transforming orthogonal inductive definition sets into confluent term rewrite systems ⋮ Mechanizing and improving dependency pairs ⋮ Proving termination by dependency pairs and inductive theorem proving ⋮ A New Approach to Non-termination Analysis of Logic Programs ⋮ Termination of narrowing via termination of rewriting ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs

This page was built for publication: Automated Termination Analysis for Logic Programs by Term Rewriting