On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103): Difference between revisions

Latest revision as of 08:11, 4 July 2024

scientific article; zbMATH DE number 5934434

Language	Label	Description	Also known as
English	On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs	scientific article; zbMATH DE number 5934434

Statements

instance of

scholarly article

0 references

title

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (English)

0 references

0 references

0 references

0 references

Functional and Constraint Logic Programming

0 references

publication date

29 July 2011

0 references

describes a project that uses

AProVE

0 references

Tyrolean

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-22531-4_9

0 references

cites work

Incorporating decision procedures in implicit induction.

0 references

Termination of term rewriting using dependency pairs

0 references

Term Rewriting and All That

0 references

Orderings and Constraints: Theory and Practice of Proving Termination

0 references

Implicit induction in conditional theories

0 references

Automated Induction with Constrained Tree Automata

0 references

Completion of rewrite systems with membership constraints. I: Deduction rules

0 references

Completion of rewrite systems with membership constraints. II: Constraint solving

0 references

Inductive Decidability Using Implicit Induction

0 references

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

0 references

A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

0 references

Maximal Termination

0 references

Proving Termination of Integer Term Rewriting

0 references

Logic for Programming, Artificial Intelligence, and Reasoning

0 references

Proving Termination by Bounded Increase

0 references

Automated Deduction – CADE-19

0 references

Tyrolean termination tool: techniques and features

0 references

Q4953875

0 references

Q4494366

0 references

Redundancy criteria for constrained completion

0 references

Q2783416

0 references

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs

0 references

Q3819991

0 references

Identifiers

zbMATH Open document ID

1339.68141

0 references

DOI

10.1007/978-3-642-22531-4_9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5200103

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-22531-4_9
+Normal rank
@@ Property / OpenAlex ID @@
+W5060831
@@ Property / OpenAlex ID: W5060831 / rank @@
+Normal rank
@@ Property / cites work @@
+Incorporating decision procedures in implicit induction.
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+Orderings and Constraints: Theory and Practice of Proving Termination
+Normal rank
@@ Property / cites work @@
+Implicit induction in conditional theories
@@ Property / cites work: Implicit induction in conditional theories / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Induction with Constrained Tree Automata
+Normal rank
@@ Property / cites work @@
+Completion of rewrite systems with membership constraints. I: Deduction rules
+Normal rank
@@ Property / cites work @@
+Completion of rewrite systems with membership constraints. II: Constraint solving
+Normal rank
@@ Property / cites work @@
+Inductive Decidability Using Implicit Induction
@@ Property / cites work: Inductive Decidability Using Implicit Induction / rank @@
+Normal rank
@@ Property / cites work @@
+Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
+Normal rank
@@ Property / cites work @@
+A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
+Normal rank
@@ Property / cites work @@
+Maximal Termination
@@ Property / cites work: Maximal Termination / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Termination of Integer Term Rewriting
@@ Property / cites work: Proving Termination of Integer Term Rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Proving Termination by Bounded Increase
@@ Property / cites work: Proving Termination by Bounded Increase / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Deduction – CADE-19
@@ Property / cites work: Automated Deduction – CADE-19 / rank @@
+Normal rank
@@ Property / cites work @@
+Tyrolean termination tool: techniques and features
+Normal rank
@@ Property / cites work @@
+Q4953875
@@ Property / cites work: Q4953875 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4494366
@@ Property / cites work: Q4494366 / rank @@
+Normal rank
@@ Property / cites work @@
+Redundancy criteria for constrained completion
@@ Property / cites work: Redundancy criteria for constrained completion / rank @@
+Normal rank
@@ Property / cites work @@
+Q2783416
@@ Property / cites work: Q2783416 / rank @@
+Normal rank
@@ Property / cites work @@
+On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
+Normal rank
@@ Property / cites work @@
+Q3819991
@@ Property / cites work: Q3819991 / rank @@
+Normal rank