Modular proofs for completeness of hierarchical term rewriting systems
From MaRDI portal
Recommendations
- Modular properties of composable term rewriting systems
- Modularity in term rewriting revisited
- scientific article; zbMATH DE number 1088278
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- On the modularity of termination of term rewriting systems
- Modular termination proofs for rewriting using dependency pairs
- scientific article; zbMATH DE number 1765695
- On the completeness of modular proof systems
- Modular term rewriting systems and the termination
- On modularity in infinitary term rewriting
Cites work
- scientific article; zbMATH DE number 4180808 (Why is no real title available?)
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- scientific article; zbMATH DE number 4074466 (Why is no real title available?)
- scientific article; zbMATH DE number 408800 (Why is no real title available?)
- scientific article; zbMATH DE number 1300971 (Why is no real title available?)
- scientific article; zbMATH DE number 1324443 (Why is no real title available?)
- scientific article; zbMATH DE number 1354152 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1995150 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- scientific article; zbMATH DE number 194506 (Why is no real title available?)
- scientific article; zbMATH DE number 1456966 (Why is no real title available?)
- Algorithmic Learning Theory
- Completeness of combinations of constructor systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Modular properties of composable term rewriting systems
- Modular properties of conditional term rewriting systems
- Modular term rewriting systems and the termination
- Modularity of completeness revisited
- Modularity of simple termination of term rewriting systems with shared constructors
- On termination of the direct sum of term-rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Termination for direct sums of left-linear complete term rewriting systems
Cited in
(22)- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- On the completeness of modular proof systems
- Transforming termination by self-labelling
- On proving \(C_E\)-termination of rewriting by size-change termination
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- scientific article; zbMATH DE number 7407797 (Why is no real title available?)
- Termination of term rewriting using dependency pairs
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories
- On proving termination by innermost termination
- Modular Termination of Basic Narrowing
- Modular termination proofs for rewriting using dependency pairs
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- scientific article; zbMATH DE number 4164136 (Why is no real title available?)
- Termination of constructor systems
- Hierarchical termination revisited.
- Modularity of termination in term graph rewriting
- Modular and incremental proofs of AC-termination
- Modularity in term rewriting revisited
- Simple termination of rewrite systems
- Modular aspects of term graph rewriting
- Modular and incremental automated termination proofs
- Canonized rewriting and ground AC completion modulo Shostak theories: design and implementation
This page was built for publication: Modular proofs for completeness of hierarchical term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350349)
