Redundancy criteria for constrained completion
From MaRDI portal
Publication:673620
DOI10.1016/0304-3975(94)00274-6zbMATH Open0873.68189OpenAlexW2091691231MaRDI QIDQ673620FDOQ673620
Authors: Juan-Miguel Gracia 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00274-6
Recommendations
Cites Work
- Proving refutational completeness of theorem-proving strategies
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Title not available (Why is that?)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure
- Critical pair criteria for completion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A proof theory for general unification
- Unnecessary inferences in associative-commutative completion procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consider only general superpositions in completion procedures
- SOLVING SYMBOLIC ORDERING CONSTRAINTS
- Complete sets of reductions with constraints
- Using forcing to prove completeness of resolution and paramodulation
Cited In (7)
- Complete sets of reductions with constraints
- Local simplification
- Harald Ganzinger's legacy: contributions to logics and programming
- Local simplification
- Rewrite semantics for production rule systems: theory and applications
- Redundancy criteria for constrained completion
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
This page was built for publication: Redundancy criteria for constrained completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673620)
