Tractable and intractable instances of combination problems for unification and disunification

DOI10.1093/LOGCOM/10.1.105MaRDI QIDQ4952028zbMATH OpenOpenAlexFDO

Authors K. 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)

Recommendations

• Unification algorithms cannot be combined in polynomial time
• A criterion for intractability of \(E\)-unification with free function symbols and its relevance for combination of unification algorithms
• Unification algorithms cannot be combined in polynomial time.
• Unification in the union of disjoint equational theories: Combining decision procedures

Cited in

(4)

• Unification algorithms cannot be combined in polynomial time.
• Unification algorithms cannot be combined in polynomial time
• A criterion for intractability of \(E\)-unification with free function symbols and its relevance for combination of unification algorithms
• scientific article; zbMATH DE number 4037063 (Why is no real title available?)

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

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