An algorithm for general set unification and its complexity

DOI10.1023/A:1006019227709zbMATH Open0927.68044OpenAlexW1557124064MaRDI QIDQ1285862

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) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (3)

Efficient HEX-Program Evaluation Based on Unfounded Sets ⋮ Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case ⋮ Title not available (Why is that?)

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)