Abstract
A temporal constraint language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for Ord-Horn languages: probably the most widely studied family of all temporal constraint languages.
We restrict ourselves to a natural subclass that we call dually-closed Ord-Horn languages. The main result of the paper states that the QCSP for a dually-closed Ord-Horn language is either in P or it is coNP-hard.
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
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 216–226 (1978)
Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems. Journal of the ACM 57(2), 1–41 (2009); An extended abstract appeared in the Proceedings of the Symposium on Theory of Computing (STOC 2008)
Garey, M., Johnson, D.: A guide to NP-completeness. CSLI Press, Stanford (1978)
Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: A revised report. Reading in Qualitative Reasoning about Physical Systems, 373–381 (1989)
Nebel, B., Bürckert, H.J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM 42(1), 43–66 (1995)
Möhring, R.H., Skutella, M., Stork, F.: Scheduling with and/or precedence constraints. SIAM Journal on Computing 33(2), 393–415 (2004)
Börner, F., Bulatov, A.A., Jeavons, P., Krokhin, A.A.: Quantified constraints: Algorithms and complexity. In: CSL, pp. 58–70 (2003)
Chen, H.: Meditations on quantified constraint satisfaction. In: Logic and Program Semantics, pp. 35–49 (2012)
Bodirsky, M., Chen, H.: Quantified equality constraints. SIAM Journal on Computing 39(8), 3682–3699 (2010); A preliminary version of the paper appeared in the proceedings of LICS 2007
Chen, H., Müller, M.: An algebraic preservation theorem for aleph-zero categorical quantified constraint satisfaction. In: LICS, pp. 215–224 (2012)
Charatonik, W., Wrona, M.: Tractable quantified constraint satisfaction problems over positive temporal templates. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 543–557. Springer, Heidelberg (2008)
Charatonik, W., Wrona, M.: Quantified positive temporal constraints. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 94–108. Springer, Heidelberg (2008)
Chen, H., Wrona, M.: Guarded ord-horn: A tractable fragment of quantified constraint satisfaction. In: TIME, pp. 99–106 (2012)
Bodirsky, M., Nešetřil, J.: Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation 16(3), 359–373 (2006)
Wrona, M.: Syntactically characterizing local-to-global consistency in ORD-horn. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 704–719. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Wrona, M. (2014). Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-662-44522-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44521-1
Online ISBN: 978-3-662-44522-8
eBook Packages: Computer ScienceComputer Science (R0)