On Forward Closure and the Finite Variant Property

DOI10.1007/978-3-642-40885-4_23MaRDI QIDQ2849500zbMATH OpenOpenAlexWikidataFDO

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

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

term rewritingundecidabilityequational unificationfinite variant propertyforward closure

Mathematics Subject Classification ID

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

Recommendations

• Some closure properties of finite definitions
• Bounds for D-finite closure properties
• scientific article; zbMATH DE number 2097290
• A theory of finite closure spaces based on implications
• Closure properties of \(\varinjlim \mathcal{C}\)
• On the finite closure property for fusions of generic classes
• Properness under closed forcing
• Closure under transfinite extensions
• On properties of some weak forms of the closure operator
• On some variants of compactness

Cited in

(20)

• Optimization of rewrite theories by equational partial evaluation
• Variants in the Infinitary Unification Wonderland
• Built-in variant generation and unification, and their applications in Maude 2.7
• Symbolic Specialization of Rewriting Logic Theories with Presto
• Non-disjoint combined unification and closure by equational paramodulation
• Effectively Checking the Finite Variant Property
• Rule-based unification in combined theories and the finite variant property
• Some closure properties of finite definitions
• Variants and satisfiability in the infinitary unification wonderland
• A partial evaluation framework for order-sorted equational programs modulo axioms
• Optimizing Maude programs via program specialization
• Term Rewriting and Applications
• scientific article; zbMATH DE number 2090320 (Why is no real title available?)
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• Constant runtime complexity of term rewriting is semi-decidable
• Symbolic computation in Maude: some tapas
• scientific article; zbMATH DE number 7453112 (Why is no real title available?)
• scientific article; zbMATH DE number 7455704 (Why is no real title available?)
• Terminating non-disjoint combined unification
• Variant-Based Satisfiability in Initial Algebras

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849500)