A Decision Algorithm for Stratified Context Unification

DOI10.1093/LOGCOM/12.6.929MaRDI QIDQ4796458zbMATH OpenOpenAlexFDO

Authors Manfred Schmidt-Schauß

Publication date 16 September 2003

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/00ff56c0db3d69691448b46230a7195827ef9f33

zbMATH Keywords

automated deductionstring unificationunificationconstraint solvingcontext unification

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 1841840
• Deciding context unification
• On rewrite constraints and context unification
• Stratified Context Unification Is NP-Complete
• On equality up-to constraints over finite trees, context unification, and one-step rewriting

Cited in

(13)

• Context unification with one context variable
• On the complexity of bounded second-order unification and stratified context unification
• On rewrite constraints and context unification
• On the relation between context and sequence unification
• Decidability of bounded second order unification
• scientific article; zbMATH DE number 1841840 (Why is no real title available?)
• Regular patterns in second-order unification
• System description: E.T. 0.1
• Decidability of bounded higher-order unification
• On equality up-to constraints over finite trees, context unification, and one-step rewriting
• Simplifying the signature in second-order unification
• Dominance constraints in stratified context unification
• Stratified Context Unification Is NP-Complete

This page was built for publication: A Decision Algorithm for Stratified Context Unification

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