Recommendations
- Multi-completion with Termination Tools (System Description)
- Strategy compliant multi-threaded term completion
- Termination tools in ordered completion
- Fine-grained concurrent completion
- Publication:3196855
- scientific article; zbMATH DE number 1263425
- Termination criteria for tree automata completion
- Multi-dimensional interpretations for termination of term rewriting
- AC completion with termination tools
- Completion for constrained term rewriting systems
Cites work
- scientific article; zbMATH DE number 3928345 (Why is no real title available?)
- scientific article; zbMATH DE number 3928346 (Why is no real title available?)
- scientific article; zbMATH DE number 50648 (Why is no real title available?)
- scientific article; zbMATH DE number 1241628 (Why is no real title available?)
- scientific article; zbMATH DE number 1263425 (Why is no real title available?)
- scientific article; zbMATH DE number 1552512 (Why is no real title available?)
- scientific article; zbMATH DE number 1765659 (Why is no real title available?)
- scientific article; zbMATH DE number 1414284 (Why is no real title available?)
- scientific article; zbMATH DE number 6027911 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- AC completion with termination tools
- About the rewriting systems produced by the Knuth-Bendix completion algorithm
- Completion for multiple reduction orderings
- Critical pair criteria for completion
- Equational inference, canonical proofs, and proof orderings
- Existence, Uniqueness, and Construction of Rewrite Systems
- Experiments with discrimination-tree indexing and path indexing for term retrieval
- Knuth-Bendix completion of theories of commuting group endomorphisms
- Maximal completion
- Mining propositional simplification proofs for small validating clauses
- Multi-completion with Termination Tools (System Description)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure
- Paramodulation-based theorem proving
- Proving termination of context-sensitive rewriting with MU-TERM
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- Term indexing
- Termination tools in ordered completion
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- The anatomy of vampire. Implementing bottom-up procedures with code trees
Cited in
(8)- Termination tools in ordered completion
- AC completion with termination tools
- Normalized completion revisited
- Towards automated deduction in cP systems
- Multi-completion with Termination Tools (System Description)
- Fine-grained concurrent completion
- Encoding dependency pair techniques and control strategies for maximal completion
- Left-Linear Completion with AC Axioms
This page was built for publication: Multi-completion with termination tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352956)
