scientific article; zbMATH DE number 1765702
From MaRDI portal
Publication:4539643
zbMATH Open0988.68162MaRDI QIDQ4539643FDOQ4539643
Authors: Aart Middeldorp 
Publication date: 10 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830593
Title of this publication is not available (Why is that?)
Recommendations
Cited In (20)
- Decidable call-by-need computations in term rewriting
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
- Match-bounds revisited
- Title not available (Why is that?)
- Term orderings for non-reachability of (conditional) rewriting
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- Automating the dependency pair method
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Beyond Dependency Graphs
- Hierarchical termination revisited.
- Graph decompositions and tree automata in reasoning with uncertainty
- Deciding \(\mathcal H_1\) by resolution
- Use of logical models for proving infeasibility in term rewriting
- Mechanically proving termination using polynomial interpretations
- Elimination transformations for associative-commutative rewriting systems
- Modular termination proofs for rewriting using dependency pairs
- Modular and incremental automated termination proofs
- Proving semantic properties as first-order satisfiability
- Mechanizing and improving dependency pairs
- Context-sensitive dependency pairs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539643)
