Syntacticness, cycle-syntacticness and shallow theories
From MaRDI portal
(Redirected from Publication:1327397)
Recommendations
Cited in
(20)- Termination of narrowing revisited
- Set constraints in some equational theories
- Decidability and complexity analysis by basic paramodulation
- The unification problem for confluent right-ground term rewriting systems.
- Induction = I-axiomatization + first-order consistency.
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- Terminating non-disjoint combined unification
- Modular proof systems for partial functions with Evans equality
- Set constraints with intersection
- Unification and matching in hierarchical combinations of syntactic theories
- Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent
- scientific article; zbMATH DE number 1189060 (Why is no real title available?)
- scientific article; zbMATH DE number 1300966 (Why is no real title available?)
- “Syntactic” AC-unification
- Computing knowledge in equational extensions of subterm convergent theories
- Uniqueness of normal forms for shallow term rewrite systems
- Grid structures and undecidable constraint theories
- A fast decision procedure for uniqueness of normal forms w.r.t. conversion of shallow term rewriting systems
- Solving quantitative equations
- Non-disjoint combined unification and closure by equational paramodulation
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)
