Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case

DOI10.1007/s002000050109zbMath0936.68025OpenAlexW2153217522MaRDI QIDQ1290508

Alberto Policriti, Eugenio Giovanni Omodeo, Agostino Dovier

Publication date: 2 June 1999

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050109

zbMATH Keywords

bisimulationsunification problemhypersets

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Set theory (03E99)

Related Items (2)

Unnamed Item ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators

This page was built for publication: Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case