NDLI: Constraint Satisfaction with Counting Quantifiers

Please wait, while we are loading the content...

Constraint Satisfaction with Counting Quantifiers

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Madelaine, Florent Stacho, Juraj Martin, Barnaby
Copyright Year	2015
Abstract	We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$ which assert the existence of at least $j$ elements such that the ensuing property holds. These are natural variants of CSPs in the mould of quantified CSPs (QCSPs). Namely, $\exists^{\geq 1}:=\exists$ and $\exists^{\geq n}:=\forall$ (for the domain of size $n$). We observe that a single counting quantifier $\exists^{\geq j}$ strictly between $\exists$ and $\forall$ already affords the maximal possible complexity of QCSPs (which have both $\exists$ and $\forall$), namely, being Pspace-complete for a suitably chosen template. Therefore, to better understand the complexity of this problem, we focus on restricted cases for which we derive the following results. First, for all subsets of counting quantifiers on clique and cycle templates, we give a full trichotomy---all such problems are in P, NP-complete, or Pspace-complete. Second, we consider the problem with exactly two quantifiers: $\exists^{\geq 1}:=\exists$ and $\exists^{\geq j}$ ($j \neq 1$). Such a CSP is already NP-hard on nonbipartite graph templates. We explore the situation of this generalized CSP on graph templates, giving various conditions for both tractability and hardness. For quantifiers $\exists^{\geq 1}$ and $\exists^{\geq 2}$, we give a dichotomy for all graphs, namely, the problem is NP-hard if the graph contains a triangle or has girth at least 5, and is in P otherwise. We strengthen this result in the following two ways. For bipartite graphs, the problem is in P for forests and graphs of girth 4, and is Pspace-hard otherwise. For complete multipartite graphs, the problem is in L, NP-complete, or Pspace-complete. Finally, using counting quantifiers we solve the complexity of a concrete QCSP whose complexity was previously open.
Starting Page	1065
Ending Page	1113
Page Count	49
File Format	PDF
ISSN	08954801
DOI	10.1137/140981332
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	2
Volume Number	29
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2015-06-16
Access Restriction	Subscribed
Subject Keyword	counting quantifiers Analysis of algorithms and problem complexity Logic in computer science retraction quantified constraint satisfaction Graph algorithms computational complexity
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Compaction, Retraction, and Constraint Satisfaction

Constraint Satisfaction with Counting Quantifiers 2

An Effective Dichotomy for the Counting Constraint Satisfaction Problem

The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case

Constraint Satisfaction with Counting Quantifiers

Computational Complexity of Compaction to Reflexive Cycles

Nonnegative Weighted #CSP: An Effective Complexity Dichotomy

The Complexity of Weighted Boolean #CSP

Quantified Equality Constraints

Constraint Satisfaction with Counting Quantifiers

Similar Documents

Compaction, Retraction, and Constraint Satisfaction

Constraint Satisfaction with Counting Quantifiers 2

An Effective Dichotomy for the Counting Constraint Satisfaction Problem

The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case

Constraint Satisfaction with Counting Quantifiers

Computational Complexity of Compaction to Reflexive Cycles

Nonnegative Weighted #CSP: An Effective Complexity Dichotomy

The Complexity of Weighted Boolean #CSP

Quantified Equality Constraints

Constraint Satisfaction with Counting Quantifiers