The following pages link to Set unification (Q3422416):
Displaying 16 items.
- Disunification in ACI1 theories (Q704658) (← links)
- A \(\lambda\)-unifiability test for set theory (Q751644) (← links)
- An algorithm for general set unification and its complexity (Q1285862) (← links)
- Automated proof of Bell-LaPadula security properties (Q2031424) (← links)
- An automatically verified prototype of the Tokeneer ID station specification (Q2069869) (← links)
- On sampling representatives of relational schemas with a functional dependency (Q2103897) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- Solving quantifier-free first-order constraints over finite sets and binary relations (Q2303241) (← links)
- External sources of knowledge and value invention in logic programming (Q2457798) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- (Q5087785) (← links)
- (Q5087786) (← links)
- Extensions of unification modulo ACUI (Q5139274) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)
