Abstract
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs).
We show that a single counting quantifier strictly between ∃ ≥ 1: = ∃ and ∃ ≥ n: = ∀ (the domain being of size n) already affords the maximal possible complexity of QCSPs (which have both ∃ and ∀), being Pspace-complete for a suitably chosen template.
Next, we focus on the complexity of subsets of counting quantifiers on clique and cycle templates. For cycles we give a full trichotomy – all such problems are in L, NP-complete or Pspace-complete. For cliques we come close to a similar trichotomy, but one class remains outstanding.
Afterwards, we consider the generalisation of CSPs in which we augment the extant quantifier ∃ ≥ 1: = ∃ with the quantifier ∃ ≥ j (j ≠ 1). Such a CSP is already NP-hard on non-bipartite graph templates. We explore the situation of this generalised CSP on bipartite templates, giving various conditions for both tractability and hardness – culminating in a classification theorem for general graphs.
Finally, we use counting quantifiers to solve the complexity of a concrete QCSP whose complexity was previously open.
The authors gratefully acknowledge the facilities of the Fields Institute in Toronto where the some of the work on this project was done during the Thematic Program of the institute in Mathematics of Constraint Satisfaction in August 2011.
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
Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing 38(5), 1782–1802 (2009)
Bodirsky, M., Kára, J., Martin, B.: The complexity of surjective homomorphism problems – a survey. CoRR abs/1104.5257 (2011)
Börner, F., Bulatov, A.A., Chen, H., Jeavons, P., Krokhin, A.A.: The complexity of constraint satisfaction games and qcsp. Inf. Comput. 207(9), 923–944 (2009)
Börner, F., Krokhin, A., Bulatov, A., Jeavons, P.: Quantified constraints and surjective polymorphisms. Tech. Rep. PRG-RR-02-11, Oxford University (2002)
Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53(1), 66–120 (2006)
Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Chen, H.: The complexity of quantified constraint satisfaction: Collapsibility, sink algebras, and the three-element case. SIAM J. Comput. 37(5), 1674–1701 (2008)
Chen, H.: Existentially restricted quantified constraint satisfaction. Inf. Comput. 207(3), 369–388 (2009)
Chen, H.: Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. Algebra Universalis 65, 213–241 (2011)
Clark, R., Grossman, M.: Number sense and quantifier interpretation. Topoi 26(1), 51–62 (2007)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer (1999)
Feder, T., Hell, P.: List homomorphisms to reflexive graphs. J. Comb. Theory, Ser. B 72(2), 236–250 (1998)
Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19(4), 487–505 (1999)
Feder, T., Hell, P., Jonsson, P., Krokhin, A.A., Nordh, G.: Retractions to pseudoforests. SIAM J. Discrete Math. 24(1), 101–112 (2010)
Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57–104 (1999)
Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48, 92–110 (1990)
Hemaspaandra, E.: Dichotomy theorems for alternation-bounded quantified boolean formulas. CoRR cs.CC/0406006 (2004)
Kolaitis, P.G., Vardi, M.Y.: A logical Approach to Constraint Satisfaction. In: Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag New York, Inc. (2005)
Lange, K.-J.: Some results on majority quantifiers over words. In: Proceedings of 19th IEEE Annual Conference on Computational Complexity, pp. 123–129 (June 2004)
Martin, B.: First-Order Model Checking Problems Parameterized by the Model. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 417–427. Springer, Heidelberg (2008)
Martin, B., Madelaine, F.: Towards a Trichotomy for Quantified H-Coloring. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 342–352. Springer, Heidelberg (2006)
Otto, M.: Bounded variable logics and counting – A study in finite models, vol. 9, IX+183 pages. Springer (1997)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 1–24 (2008)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216–226 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Madelaine, F., Martin, B., Stacho, J. (2012). Constraint Satisfaction with Counting Quantifiers. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-30642-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30641-9
Online ISBN: 978-3-642-30642-6
eBook Packages: Computer ScienceComputer Science (R0)