Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berghammer, R.: A generic program for minimal subsets with applications. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol. 2664, pp. 144–157. Springer, Heidelberg (2003)
Berghammer, R., Milanese, U.: Relational approach to Boolean logic problems. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 48–59. Springer, Heidelberg (2006)
Kehden, B., Neumann, F., Berghammer, R.: Relational implementation of simple parallel evolutionary algorithms. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 161–172. Springer, Heidelberg (2006)
Kehden, B., Neumann, F.: A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 147–158. Springer, Heidelberg (2006)
Schmidt, G., Ströhlein, T.: Relations and graphs. Springer, Heidelberg (1993)
Berghammer, R.: Relational-algebraic computation of fixed points with applications. The Journal of Logic and Algebraic Programming 66, 112–126 (2006)
Berghammer, R., Zierer, H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theoretical Computer Science 43 (1986)
Schmidt, G., Ströhlein, T.: Some aspects in the construction of timetables. In: Proc. IFIP Congress Information processing 74, Stockholm, vol. 1074, pp. 516–520. North- Holland, Amsterdam (1974)
Schmidt, G., Ströhlein, T.: A Boolean matrix iteration in timetable construction. Linear Algebra and Appl. 15(1), 27–51 (1976)
Wegener, I.: Complexity Theory. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kehden, B. (2006). Evaluating Sets of Search Points Using Relational Algebra. In: Schmidt, R.A. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2006. Lecture Notes in Computer Science, vol 4136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11828563_18
Download citation
DOI: https://doi.org/10.1007/11828563_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37873-0
Online ISBN: 978-3-540-37874-7
eBook Packages: Computer ScienceComputer Science (R0)