Set unification

DOI10.1017/S1471068406002730zbMath1108.68104DBLPjournals/tplp/DovierPR06OpenAlexW2913519671WikidataQ57840347 ScholiaQ57840347MaRDI QIDQ3422416

Agostino Dovier, Gianfranco Rossi, Enrico Pontelli

Publication date: 13 February 2007

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068406002730

zbMATH Keywords

Unification algorithms

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (13)

Automated reasoning with restricted intensional sets ⋮ Type inference for rank-2 intersection types using set unification ⋮ Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ Extensions of unification modulo ACUI ⋮ External sources of knowledge and value invention in logic programming ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automated proof of Bell-LaPadula security properties ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations ⋮ An automatically verified prototype of the Tokeneer ID station specification ⋮ On sampling representatives of relational schemas with a functional dependency

This page was built for publication: Set unification