All Questions
Tagged with logical-relations sat
1 question
1
vote
1
answer
80
views
Efficient algorithm/ implementation to compute Transitive Closure of a Rule with respect to a Relationship
(Recalling some) Definitions:
Fix a finite collection of finite sets: $A_1,\ldots,A_k$. Then relationship $R\subseteq A_1 \times A_2 \times \ldots\times A_k$. (Remark: $A_i$'s need not be distinct.)
...
- 111