On Forward Closure and the Finite Variant Property

DOI10.1007/978-3-642-40885-4_23zbMATH Open1398.68271OpenAlexW2112044534WikidataQ118190387 ScholiaQ118190387MaRDI QIDQ2849500FDOQ2849500

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

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

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)

Cited In (20)

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

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)