Normalized rewriting: An alternative to rewriting modulo a set of equations
From MaRDI portal
Publication:2563692
DOI10.1006/jsco.1996.0011zbMath0859.68050OpenAlexW2128937477MaRDI QIDQ2563692
Publication date: 21 January 1997
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1996.0011
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grammars and rewriting systems (68Q42)
Related Items
Extending reduction orderings to ACU-compatible reduction orderings, Coherent confluence modulo relations and double groupoids, AC-complete unification and its application to theorem proving, Modular and incremental proofs of AC-termination, Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties, Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures, Extensions of unification modulo ACUI, Superposition with completely built-in abelian groups, A new symbolic method for solving linear two-point boundary value problems on the level of operators, Canonized Rewriting and Ground AC Completion Modulo Shostak Theories, Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures, Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I, Anti-patterns for rule-based languages, Extending Maximal Completion (Invited Talk), Superposition theorem proving for abelian groups represented as integer modules, Combination of convex theories: modularity, deduction completeness, and explanation, Term Collections in λ and ρ-calculi, Algebraic Databases, Cancellative Abelian monoids and related structures in refutational theorem proving. I, Cancellative Abelian monoids and related structures in refutational theorem proving. II, Canonical Abstract Syntax Trees, Confluence of algebraic rewriting systems
