Abstract
A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order without endpoints using a relational symbol ≤, logical conjunction and disjunction. This paper gives a complete complexity characterization for quantified constraint satisfaction problems (QCSP) over positive temporal languages. Although the constraint satisfaction problem (CSP) for an arbitrary positive temporal language is trivial (all these templates are closed under constant functions), the corresponding QCSP problems are decidable in LOGSPACE or complete for one of the following classes: NLOGSPACE, P, NP or PSPACE.
Work partially supported by Polish Ministry of Science and Education grant 3 T11C 042 30.
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.
References
Feder, T., Vardi, M.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of 25th ACM Symposium on the Theory of Computing (STOC), pp. 612–622 (1993)
Schaefer, T.: The complexity of satisfiability problems. In: Proceedings 10th ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226 (1978)
Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527–548 (1997)
Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, Canada, pp. 649–658 (2002)
Cohen, D., Jeavons, P.: The complexity of constraints languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
Krokhin, A., Jeavons, P., Jonsson, P.: A complete classification of complexity in Allens algebra in the presence of a non-trivial basic relation. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 83–88. Morgan Kaufmann, San Francisco (2001)
Bodirsky, M.: Constraint Satisfaction Problems with Infinite Domains. PhD thesis, Humboldt-Universität zu Berlin (2004), http://www2.informatik.hu-berlin.de/~bodirsky/publications/diss.html
Boerner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified constraints: Algorithms and complexity. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 58–70. Springer, Heidelberg (2003)
Bodirsky, M., Kára, J.: The complexity of equality constraint languages. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 114–126. Springer, Heidelberg (2006)
Bodirsky, M., Chen, H.: Quantified equality constraints. In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Proceedings, Wroclaw, Poland, July 10-12, pp. 203–212. IEEE Computer Society, Los Alamitos (2007)
Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems. In: Ladner, R.E., Dwork, C. (eds.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, pp. 29–38. ACM, New York (2008)
Charatonik, W., Wrona, M.: Tractable positive quantified constraint satisfaction problems (submitted, 2008), http://www.ii.uni.wroc.pl/~mwrona/publications/TQP.pdf
Bodirsky, M., Chen, H.: Qualitative temporal and spatial reasoning revisited. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 194–207. Springer, Heidelberg (2007)
Möhring, R.H., Skutella, M., Stork, F.: Scheduling with and/or precedence constraints. SIAM J. Comput. 33(2), 393–415 (2004)
Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Charatonik, W., Wrona, M. (2008). Quantified Positive Temporal Constraints. In: Kaminski, M., Martini, S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-87531-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87530-7
Online ISBN: 978-3-540-87531-4
eBook Packages: Computer ScienceComputer Science (R0)