Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
A generic program for minimal subsets with applications
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Relational approach to boolean logic problems
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Relational implementation of simple parallel evolutionary algorithms
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
A relation-algebraic view on evolutionary algorithms for some graph problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
State space analysis of Petri nets with relation-algebraic methods
Journal of Symbolic Computation
Relation algebra and relview in practical use: construction of special university timetables
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Multi-objective problems in terms of relational algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
| Hi-index | 0.00 |
We model a set of search points as a relation and use relational algebra to evaluate all elements of the set in one step in order to select search points with certain properties. Therefore we transform relations into vectors and prove a formula to translate properties of relations into properties of the corresponding vectors. This approach is applied to timetable problems.