Two-Restricted One Context Unification is in Polynomial Time

DOI10.4230/LIPICS.CSL.2015.405zbMath1373.68269OpenAlexW2310194302MaRDI QIDQ5351971

Adrià Gascón, Ashish Kumar Tiwari, Manfred Schmidt-Schauss

Publication date: 31 August 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/csl/csl2015.html#GasconST15

zbMATH Keywords

deductiontype checkingcontext unificationfirst-order unification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

This page was built for publication: Two-Restricted One Context Unification is in Polynomial Time