Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case
type: Item
instance of: scholarly article
title: Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case
zbMATH Open document ID: 0936.68025
author: Agostino Dovier
author: Eugenio Omodeo
author: Alberto Policriti
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1999-06-02T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03E99
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 1294579
zbMATH Keywords: bisimulations
zbMATH Keywords: hypersets
zbMATH Keywords: unification problem
MaRDI profile type: Publication
full work available at URL: s002000050109
OpenAlex ID: W2153217522
DOI: 10.1007/S002000050109
Recommended article: Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
Recommended article: Q3002400
Recommended article: Abstract Domains and Solvers for Sets Reasoning
Recommended article: Q4506398
Recommended article: An algorithm for general set unification and its complexity
Recommended article: HYPERSOLVER: A graphical tool for commonsense set theory
Recommended article: Logic Programming
Recommended article: Principles and Practice of Constraint Programming – CP 2004
Recommended article: Hybrid set structures for soft computing
Recommended article: An efficient labelled nested multiset unification algorithm
description: scientific article; zbMATH DE number 1294579