Increasing interpretations
type: Item
instance of: scholarly article
title: Increasing interpretations
zbMATH Open document ID: 1191.68368
author: Harald Zankl
author: Aart Middeldorp
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2009-12-11T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 5645709
zbMATH Keywords: term rewrite systems
zbMATH Keywords: dependency graph
describes a project that uses: AProVE
describes a project that uses: Matchbox
describes a project that uses: MiniSat
describes a project that uses: Tyrolean
describes a project that uses: Jambox
MaRDI profile type: Publication
full work available at URL: s10472-009-9144-7
OpenAlex ID: W2913551129
cites work: Termination of term rewriting using dependency pairs
cites work: Term Rewriting and All That
cites work: Theory and Applications of Satisfiability Testing
cites work: Matrix interpretations for proving termination of term rewriting
cites work: SAT Solving for Termination Analysis with Polynomial Interpretations
cites work: Maximal Termination
cites work: Search Techniques for Rational Polynomial Orders
cites work: On tree automata that certify termination of left-linear term rewriting systems
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Frontiers of Combining Systems
cites work: Mechanizing and improving dependency pairs
cites work: Artificial Intelligence and Symbolic Computation
cites work: Automating the dependency pair method
cites work: Tyrolean termination tool: techniques and features
cites work: Testing positiveness of polynomials
cites work: Arctic Termination ...Below Zero
cites work: Proving Termination of Rewrite Systems Using Bounds
cites work: Increasing Interpretations
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: Termination by Quasi-periodic Interpretations
DOI: 10.1007/S10472-009-9144-7
description: scientific article; zbMATH DE number 5645709