A Decision Algorithm for Stratified Context Unification

DOI10.1093/LOGCOM/12.6.929zbMATH Open1019.03002OpenAlexW1988935908MaRDI QIDQ4796458FDOQ4796458

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

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

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)

Cited In (11)

• Simplifying the signature in second-order unification
• Dominance constraints in stratified context unification
• On rewrite constraints and context unification
• Decidability of bounded second order unification
• On the relation between context and sequence unification
• Decidability of bounded higher-order unification
• Context unification with one context variable
• Title not available (Why is that?)
• Regular Patterns in Second-Order Unification
• Stratified Context Unification Is NP-Complete
• System Description: E.T. 0.1

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)