Tractable and intractable instances of combination problems for unification and disunification

DOI10.1093/LOGCOM/10.1.105zbMath0949.68085OpenAlexW1971031980MaRDI QIDQ4952028

Klaus U. Schulz

Publication date: 5 December 2000

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/10.1.105

zbMATH Keywords

decision procedurescombination algorithm

Mathematics Subject Classification ID

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

This page was built for publication: Tractable and intractable instances of combination problems for unification and disunification