An algorithm for general set unification and its complexity

DOI10.1023/A:1006019227709MaRDI QIDQ1285862zbMATH OpenOpenAlexFDO

Authors Frieder Stolzenburg

Publication date 31 May 1999

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006019227709

zbMATH Keywords

complexitylogic programmingProlog

Mathematics Subject Classification ID

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

Recommendations

• Set unification
• scientific article; zbMATH DE number 1332632
• scientific article; zbMATH DE number 1330135
• scientific article; zbMATH DE number 3995082
• Publication:4506398

Cited in

(8)

• Efficient HEX-Program Evaluation Based on Unfounded Sets
• scientific article; zbMATH DE number 1508935 (Why is no real title available?)
• Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case
• An efficient labelled nested multiset unification algorithm
• Amortized Analysis of Algorithms for Set Union with Backtracking
• scientific article; zbMATH DE number 4049047 (Why is no real title available?)
• Set unification
• scientific article; zbMATH DE number 4049129 (Why is no real title available?)

This page was built for publication: An algorithm for general set unification and its complexity

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