The following pages link to (Q4854001):
Displayed 9 items.
- Abstract derivation of transitive closure algorithms (Q287162) (← links)
- Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← links)
- Similarity analysis in Bayesian random partition models (Q452533) (← links)
- Analysis of distributed consensus protocols with multi-equilibria under time-delays (Q681191) (← links)
- Minimal ordering constraints for some families of variable symmetries (Q976995) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Modular materialisation of Datalog programs (Q2144176) (← links)
- Absorption for ABoxes (Q2351418) (← links)
- Maximal and Maximum Transitive Relation Contained in a Given Binary Relation (Q3196418) (← links)