Quantified Constraint Satisfaction is a formal framework within the broader class of constraint satisfaction problems that extends classical constraint models by incorporating quantifiers over variables, thereby enabling the expression of dependencies and adversarial or strategic reasoning in a logical structure.
55
Publications
2.1K
Citations
104
Authors
72
Institutions
Publications per year
2017–2026
6
Variants
Qcs
Parents
Publications
55
Tractability and Learnability Arising from Algebras with Few Subpowers
Paweł M. Idziak, Petar Marković, Ralph McKenzie et al. · SIAM Journal on Computing · 2010 · 128 citations · Full text
1–5 of 55
Authors
104
- HC
5
h-index
- PN
4
h-index
- SRStefan Ratschan
Czech Academy of Sciences, Institute of Computer Science, Czechia
4 publications · 137 citations
4
h-index
- BM
4
h-index
- FM
3
h-index
1–5 of 104
Institutions
72
University of St Andrews
St Andrews, United Kingdom
4 h-index
9 publications
248 citations
Arts et Métiers
Paris, France
3 h-index
8 publications
311 citations
Universitat Pompeu Fabra
Barcelona, Spain
3 h-index
3 publications
72 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
44 citations
Microsoft (United States)
Redmond, United States
3 h-index
4 publications
74 citations
Cornell University
Ithaca, United States
3 h-index
3 publications
73 citations
Durham University
Durham, United Kingdom
3 h-index
3 publications
36 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
55 citations
1–8 of 72
Venues
- SIAM Journal on Computing
3 publications · 187 citations
3
h-index
- Engineering Applications of Artificial Intelligence
3 publications · 98 citations
3
h-index
- BIROn (Birkbeck, University of London)
Repository · 2 publications · 57 citations
2
h-index
- International Journal on Interactive Design and Manufacturing (IJIDeM)
2 publications · 38 citations
2
h-index
- European Journal of Operational Research
2 publications · 498 citations
2
h-index
1–5