This paper is concerned with the unification of set terms that differ from standard terms because of the commutative and idempotent properties. The main results are the detailed complexity analysis of the problem of set-term unification for the case that one of the terms is ground (set-term matching) and the invention of two improved matching algorithms.
Set-term Matching in Logic Programming
GRECO, Sergio;Sacca' D.
1992-01-01
Abstract
This paper is concerned with the unification of set terms that differ from standard terms because of the commutative and idempotent properties. The main results are the detailed complexity analysis of the problem of set-term unification for the case that one of the terms is ground (set-term matching) and the invention of two improved matching algorithms.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
