Maximal Termination (Q3522012)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Maximal Termination	scientific article

Statements

scholarly article

0 references

Maximal Termination (English)

0 references

0 references

0 references

Aart Middeldorp

0 references

Peter Schneider-Kamp

0 references

0 references

0 references

Rewriting Techniques and Applications

0 references

publication date

28 August 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-70590-1_8

0 references

Termination of term rewriting using dependency pairs

0 references

SAT Solving for Termination Analysis with Polynomial Interpretations

0 references

Maximal Termination

0 references

Logic for Programming, Artificial Intelligence, and Reasoning

0 references

Mechanizing and improving dependency pairs

0 references

Proving Termination by Bounded Increase

0 references

Proof of termination of the rewriting system SUBSET on CCL

0 references

Automating the dependency pair method

0 references

Tyrolean termination tool: techniques and features

0 references

Testing positiveness of polynomials

0 references

TPA: Termination Proved Automatically

0 references

<tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs

0 references

Counterexamples to termination for the direct sum of term rewriting systems

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-70590-1_8

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3522012

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3522012&oldid=35068931"