Abstract
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by reasoning about alternative activities in plans/schedules. Temporal Networks with Alternatives (TNA) were proposed to model alternative and parallel processes, however the problem of deciding which activities can be consistently included in such networks is NP-complete. Therefore a tractable subclass of Temporal Networks with Alternatives was proposed. This paper shows formal properties of these networks where precedence constraints are assumed. Namely, an algorithm that effectively recognizes whether a given network belongs to the proposed sub-class is studied and the proof of tractability is given by proposing a constraint model where global consistency is achieved via arc consistency.
This is a preview of subscription content, log in via an institution to check access.
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
Barták, R., Čepek, O.: Temporal Networks with Alternatives: Complexity and Model. In: Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS), pp. 641–646. AAAI Press, Menlo Park (2007)
Barták, R., Čepek, O.: Nested Temporal Networks with Alternatives: Recognition and Tractability. In: Applied Computing 2008 - Proceedings of 23rd Annual ACM Symposium on Applied Computing, vol. 1, pp. 156–157. ACM, New York (2008)
Barták, R., Čepek, O., Surynek, P.: Discovering Implied Constraints in Precedence Graphs with Alternatives. Annals of Operations Research. Springer, Heidelberg (to appear, 2008)
Beck, J.C., Fox, M.S.: Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence 121, 211–250 (2000)
Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM 30, 479–513 (1983)
Horling, B., Leader, V., Vincent, R., Wagner, T., Raja, A., Zhang, S., Decker, K., Harvey, A.: The Taems White Paper, University of Massachusetts (1999), http://mas.cs.umass.edu/research/taems/white/taemswhite.pdf
Kim, P., Williams, B., Abramson, M.: Executing Reactive, Model-based Programs through Graph-based Temporal Planning. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 487–493 (2001)
Kuster, J., Jannach, D., Friedrich, G.: Handling Alternative Activities in Resource-Constrained Project Scheduling Problems. In: Proceedings of Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1960–1965 (2007)
Nuijten, W., Bousonville, T., Focacci, F., Godard, D., Le Pape, C.: MaScLib: Problem description and test bed design (2003), http://www2.ilog.com/masclib
Tsamardinos, I., Vidal, T., Pollack, M.E.: CTP: A New Constraint-Based Formalism for Conditional Temporal Planning. Constraints 8(4), 365–388 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barták, R., Čepek, O. (2008). Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. In: Dochev, D., Pistore, M., Traverso, P. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2008. Lecture Notes in Computer Science(), vol 5253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85776-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-85776-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85775-4
Online ISBN: 978-3-540-85776-1
eBook Packages: Computer ScienceComputer Science (R0)