Pages that link to "Item:Q1581059"
From MaRDI portal
The following pages link to Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem (Q1581059):
Displaying 6 items.
- Applying relational algebra and REL VIEW to coalition formation (Q859932) (← links)
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs (Q1961862) (← links)
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907) (← links)
- Experimental investigation of sufficient criteria for relations to have kernels (Q2695346) (← links)
- Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures (Q2915139) (← links)