On Forward Closure and the Finite Variant Property

DOI10.1007/978-3-642-40885-4_23zbMath1398.68271OpenAlexW2112044534WikidataQ118190387 ScholiaQ118190387MaRDI QIDQ2849500

Paliath Narendran, Christopher Bouchard, Kimberly A. Gero, Christopher Lynch

Publication date: 20 September 2013

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40885-4_23

zbMATH Keywords

undecidabilityterm rewritingequational unificationfinite variant propertyforward closure

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Grammars and rewriting systems (68Q42)

Related Items (14)

Non-disjoint combined unification and closure by equational paramodulation ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Variants and satisfiability in the infinitary unification wonderland ⋮ Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) ⋮ Optimizing Maude programs via program specialization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Constant runtime complexity of term rewriting is semi-decidable ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 ⋮ Symbolic computation in Maude: some tapas ⋮ Terminating non-disjoint combined unification

This page was built for publication: On Forward Closure and the Finite Variant Property