One context unification problems solvable in polynomial time

DOI10.1109/LICS.2015.53MaRDI QIDQ4635831zbMATH OpenOpenAlexFDO

Authors Adrià Gascón, Manfred Schmidt Schaus, Ashish Tiwari

Publication date 23 April 2018

Published in 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2015.53

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• Two-restricted one context unification is in polynomial time
• Context unification with one context variable
• One-context unification with STG-compressed terms is in NP
• Deciding context unification
• New algorithms for unification modulo one-sided distributivity and its variants

Cited in

(3)

• Context unification with one context variable
• Stratified Context Unification Is NP-Complete
• Two-restricted one context unification is in polynomial time

This page was built for publication: One context unification problems solvable in polynomial time

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