Syntacticness, cycle-syntacticness and shallow theories
From MaRDI portal
Publication:1327397
DOI10.1006/INCO.1994.1043zbMATH Open0807.68062OpenAlexW2005822708MaRDI QIDQ1327397FDOQ1327397
Authors: Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud 
Publication date: 1 March 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1043
Recommendations
Cited In (17)
- Non-disjoint combined unification and closure by equational paramodulation
- Termination of narrowing revisited
- Uniqueness of normal forms for shallow term rewrite systems
- The unification problem for confluent right-ground term rewriting systems.
- Terminating non-disjoint combined unification
- Grid structures and undecidable constraint theories
- Set constraints in some equational theories
- Induction = I-axiomatization + first-order consistency.
- Decidability and complexity analysis by basic paramodulation
- Computing knowledge in equational extensions of subterm convergent theories
- Modular proof systems for partial functions with Evans equality
- Unification and matching in hierarchical combinations of syntactic theories
- “Syntactic” AC-unification
- Set constraints with intersection
- Title not available (Why is that?)
- Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
This page was built for publication: Syntacticness, cycle-syntacticness and shallow theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327397)
