Abstract
Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal model of plan databases. We describe important notions of consistency and coherence for such databases. We then propose a set of operators similar to the relational algebra to query such databases of plans.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brucker, P.: Scheduling Algorithms. Springer, New York (1995)
Chomicki, J.: Temporal query languages: a survey. In: Gabbay, D.M., Ohlbach, H.J. (eds.) ICTL 1994. LNCS, vol. 827, pp. 506–534. Springer, Heidelberg (1994)
Dyreson, C.E., Snodgrass, R.T.: Supporting valid-time indeterminacy. ACM Transactions on Database Systems 23(1), 1–57 (1998)
Fox, M., Long, D.: Pddl2.1: An extension to pddl for expressing temporal planning domains (2002), http://www.dur.ac.uk/d.p.long/pddl2.ps.gz
Gadia, S., Nair, S., Peon, Y.: Incomplete Information in Relational Temporal Databases. Vancouver (1992)
Hammond, K.J.: Case-Based Planning: Viewing planning as a memory task. Academic Press, San Diego (1989)
Koubarakis, M.: Database models for infinite and indefinite temporal information. Information Systems 19(2), 141–173 (1994)
Peng, D.-T., Shin, K.G., Abdelzaher, T.F.: Assignment and scheduling communicating periodic tasks in distributed real-time systems. Software Engineering 23(12), 745–758 (1997)
Snodgrass, R.: The temporal query language tquel. ACM Transactions on Database Systems (TODS) 12(2), 247–298 (1987)
Brusoni, P.T.V., Console, L., Pernici, B.: Qualitative and quantitative temporal constraints and relational databases:theory, architecture and applications. IEEE TKDE 11(6), 948–968 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yaman, F., Adali, S., Nau, D., Sapino, M.L., Subrahmanian, V.S. (2004). Plan Databases: Model and Algebra. In: Seipel, D., Turull-Torres, J.M. (eds) Foundations of Information and Knowledge Systems. FoIKS 2004. Lecture Notes in Computer Science, vol 2942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24627-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24627-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20965-2
Online ISBN: 978-3-540-24627-5
eBook Packages: Springer Book Archive