Constraint satisfaction problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Constraint satisfaction problem" in English language version.

refsWebsite

Global rank English rank

18doi.org

2^nd place

13arxiv.org

69^th place

59^th place

8worldcat.org

5^th place

3psu.edu

207^th place

136^th place

3web.archive.org

1^st place

3semanticscholar.org

11^th place

8^th place

2siam.org

low place

6,473^rd place

2cambridge.org

305^th place

264^th place

2handle.net

102^nd place

76^th place

2springer.com

274^th place

309^th place

1drexel.edu

9,118^th place

5,661^st place

1books.google.com

3^rd place

1st-andrews.ac.uk

1,547^th place

1,410^th place

1aclweb.org

low place

6,793^rd place

1jatit.org

low place

1uci.edu

3,063^rd place

2,041^st place

1aaai.org

9,352^nd place

5,696^th place

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

Solution reuse in dynamic constraint satisfaction problems, Thomas Schiex

aclweb.org (Global: low place; English: 6,793^rd place)

Demetriou, George C. "Lexical disambiguation using constraint handling in Prolog (CHIP)." Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics. Association for Computational Linguistics, 1993.

arxiv.org (Global: 69^th place; English: 59^th place)

Farhi, Edward; Aram W Harrow (2016). "Quantum Supremacy through the Quantum Approximate Optimization Algorithm". arXiv:1602.07674 [quant-ph].
Barto, Libor; Brady, Zarathustra; Bulatov, Andrei; Kozik, Marcin; Zhuk, Dmitriy (2024-05-15). "Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras". Theoretics. 3 11361. arXiv:2104.11808. doi:10.46298/theoretics.24.14. ISSN 2751-4838.
Bulatov, Andrei (2017). "A Dichotomy Theorem for Nonuniform CSPs". Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society. pp. 319–330. arXiv:1703.03021. doi:10.1109/FOCS.2017.37. ISBN 978-1-5386-3464-6.
Zhuk, Dmitriy (2020). "A Proof of the CSP Dichotomy Conjecture". Journal of the ACM. 67 (5): 1–78. arXiv:1704.01914. doi:10.1145/3402029.
Bodirsky, Manuel; Pinsker, Michael (2011). "Schaefer's theorem for graphs". Proceedings of the 43rd Annual Symposium on Theory of Computing (STOC '11). Association for Computing Machinery. pp. 655–664. arXiv:1011.2894. doi:10.1145/1993636.1993724. ISBN 978-1-4503-0691-1. S2CID 47097319.
Bodirsky, Manuel; Jonsson, Peter; Pham, Trung Van (2017-08-02). "The Complexity of Phylogeny Constraint Satisfaction Problems". ACM Trans. Comput. Logic. 18 (3): 23:1–23:42. arXiv:1503.07310. doi:10.1145/3105907. ISSN 1529-3785.
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András (January 2019). "Constraint Satisfaction Problems for Reducts of Homogeneous Graphs". SIAM Journal on Computing. 48 (4): 1224–1264. arXiv:1602.05819. doi:10.1137/16M1082974. ISSN 0097-5397.
Bodirsky, Manuel; Mottet, Antoine (2018-05-20), "A Dichotomy for First-Order Reducts of Unary Structures", Logical Methods in Computer Science, 14 (2) 3264, arXiv:1601.04520, doi:10.23638/LMCS-14(2:13)2018
Bodirsky, Manuel; Madelaine, Florent; Mottet, Antoine (2018-07-09). "A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '18. New York, NY, USA: Association for Computing Machinery. pp. 105–114. arXiv:1802.03255. doi:10.1145/3209108.3209156. ISBN 978-1-4503-5583-4.
Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András (March 2021). "Projective Clone Homomorphisms". The Journal of Symbolic Logic. 86 (1): 148–161. arXiv:1409.4601. doi:10.1017/jsl.2019.23. hdl:2437/268560. ISSN 0022-4812.
Pinsker, Michael (2022-03-31). "Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep". arXiv:2203.17182 [cs.LO].
Cai, Jin-Yi; Chen, Xi (2012). "Complexity of counting CSP with complex weights". Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12). pp. 909–920. arXiv:1111.2384. doi:10.1145/2213977.2214059. ISBN 978-1-4503-1245-5. S2CID 53245129.
Duffy, K.R.; Leith, D.J. (August 2013), "Decentralized Constraint Satisfaction", IEEE/ACM Transactions on Networking, 21(4), vol. 21, pp. 1298–1308, arXiv:1103.3240, doi:10.1109/TNET.2012.2222923, S2CID 11504393

books.google.com (Global: 3^rd place; English: 3^rd place)

Malik Ghallab; Dana Nau; Paolo Traverso (21 May 2004). Automated Planning: Theory and Practice. Elsevier. pp. 1–. ISBN 978-0-08-049051-9.

cambridge.org (Global: 305^th place; English: 264^th place)

Bodirsky, Manuel (2021). Complexity of Infinite-Domain Constraint Satisfaction. Lecture Notes in Logic. Cambridge: Cambridge University Press. ISBN 978-1-107-04284-1.
Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András (March 2021). "Projective Clone Homomorphisms". The Journal of Symbolic Logic. 86 (1): 148–161. arXiv:1409.4601. doi:10.1017/jsl.2019.23. hdl:2437/268560. ISSN 0022-4812.

doi.org (Global: 2^nd place; English: 2^nd place)

Chandra, Satish; Gordon, Colin S.; Jeannin, Jean-Baptiste; Schlesinger, Cole; Sridharan, Manu; Tip, Frank; Choi, Youngil (2016). "Type inference for static compilation of JavaScript" (PDF). Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications. pp. 410–429. doi:10.1145/2983990.2984017. ISBN 978-1-4503-4444-9.
Barto, Libor; Brady, Zarathustra; Bulatov, Andrei; Kozik, Marcin; Zhuk, Dmitriy (2024-05-15). "Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras". Theoretics. 3 11361. arXiv:2104.11808. doi:10.46298/theoretics.24.14. ISSN 2751-4838.
Bodirsky, Manuel; Grohe, Martin (2008). "Non-dichotomies in Constraint Satisfaction Complexity". In Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólfsdóttir, Anna; Walukiewicz, Igor (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 5126. Berlin, Heidelberg: Springer. pp. 184–196. doi:10.1007/978-3-540-70583-3_16. ISBN 978-3-540-70583-3.
Feder, Tomás; Vardi, Moshe Y. (1998). "The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory". SIAM Journal on Computing. 28 (1): 57–104. doi:10.1137/S0097539794266766. ISSN 0097-5397.
Bulatov, Andrei (2017). "A Dichotomy Theorem for Nonuniform CSPs". Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society. pp. 319–330. arXiv:1703.03021. doi:10.1109/FOCS.2017.37. ISBN 978-1-5386-3464-6.
Zhuk, Dmitriy (2020). "A Proof of the CSP Dichotomy Conjecture". Journal of the ACM. 67 (5): 1–78. arXiv:1704.01914. doi:10.1145/3402029.
Bodirsky, Manuel; Kára, Jan (2010-02-08). "The complexity of temporal constraint satisfaction problems". J. ACM. 57 (2): 9:1–9:41. doi:10.1145/1667053.1667058. ISSN 0004-5411.
Bodirsky, Manuel; Pinsker, Michael (2011). "Schaefer's theorem for graphs". Proceedings of the 43rd Annual Symposium on Theory of Computing (STOC '11). Association for Computing Machinery. pp. 655–664. arXiv:1011.2894. doi:10.1145/1993636.1993724. ISBN 978-1-4503-0691-1. S2CID 47097319.
Bodirsky, Manuel; Jonsson, Peter; Pham, Trung Van (2017-08-02). "The Complexity of Phylogeny Constraint Satisfaction Problems". ACM Trans. Comput. Logic. 18 (3): 23:1–23:42. arXiv:1503.07310. doi:10.1145/3105907. ISSN 1529-3785.
Kompatscher, Michael; Pham, Trung Van (2017). "A Complexity Dichotomy for Poset Constraint Satisfaction". 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics. Vol. 66. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 47:1–47:12. doi:10.4230/LIPIcs.STACS.2017.47. ISBN 978-3-95977-028-6.
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András (January 2019). "Constraint Satisfaction Problems for Reducts of Homogeneous Graphs". SIAM Journal on Computing. 48 (4): 1224–1264. arXiv:1602.05819. doi:10.1137/16M1082974. ISSN 0097-5397.
Bodirsky, Manuel; Mottet, Antoine (2018-05-20), "A Dichotomy for First-Order Reducts of Unary Structures", Logical Methods in Computer Science, 14 (2) 3264, arXiv:1601.04520, doi:10.23638/LMCS-14(2:13)2018
Bodirsky, Manuel; Madelaine, Florent; Mottet, Antoine (2018-07-09). "A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP". Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. LICS '18. New York, NY, USA: Association for Computing Machinery. pp. 105–114. arXiv:1802.03255. doi:10.1145/3209108.3209156. ISBN 978-1-4503-5583-4.
Barto, Libor; Kozik, Marcin (2014-01-01). "Constraint Satisfaction Problems Solvable by Local Consistency Methods". J. ACM. 61 (1): 3:1–3:19. doi:10.1145/2556646. ISSN 0004-5411.
Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András (March 2021). "Projective Clone Homomorphisms". The Journal of Symbolic Logic. 86 (1): 148–161. arXiv:1409.4601. doi:10.1017/jsl.2019.23. hdl:2437/268560. ISSN 0022-4812.
Kolaitis, Phokion G.; Vardi, Moshe Y. (2000). "Conjunctive-Query Containment and Constraint Satisfaction". Journal of Computer and System Sciences. 61 (2): 302–332. doi:10.1006/jcss.2000.1713.
Cai, Jin-Yi; Chen, Xi (2012). "Complexity of counting CSP with complex weights". Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12). pp. 909–920. arXiv:1111.2384. doi:10.1145/2213977.2214059. ISBN 978-1-4503-1245-5. S2CID 53245129.
Duffy, K.R.; Leith, D.J. (August 2013), "Decentralized Constraint Satisfaction", IEEE/ACM Transactions on Networking, 21(4), vol. 21, pp. 1298–1308, arXiv:1103.3240, doi:10.1109/TNET.2012.2222923, S2CID 11504393

drexel.edu (Global: 9,118^th place; English: 5,661^st place)

cs.drexel.edu

Chandra, Satish; Gordon, Colin S.; Jeannin, Jean-Baptiste; Schlesinger, Cole; Sridharan, Manu; Tip, Frank; Choi, Youngil (2016). "Type inference for static compilation of JavaScript" (PDF). Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications. pp. 410–429. doi:10.1145/2983990.2984017. ISBN 978-1-4503-4444-9.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András (March 2021). "Projective Clone Homomorphisms". The Journal of Symbolic Logic. 86 (1): 148–161. arXiv:1409.4601. doi:10.1017/jsl.2019.23. hdl:2437/268560. ISSN 0022-4812.
Miguel, Ian (July 2001). Dynamic Flexible Constraint Satisfaction and its Application to AI Planning (Ph.D. thesis). University of Edinburgh School of Informatics. CiteSeerX 10.1.1.9.6733. hdl:1842/326.

jatit.org (Global: low place; English: low place)

Mauricio Toro, Carlos Agon, Camilo Rueda, Gerard Assayag. "GELISP: A FRAMEWORK TO REPRESENT MUSICAL CONSTRAINT SATISFACTION PROBLEMS AND SEARCH STRATEGIES." Journal of Theoretical and Applied Information Technology 86 (2). 2016. 327–331.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Jim, Trevor, and Jens Palsberg. "Type inference in systems of recursive types with subtyping." Available on authors' web page (1999).
Modi, Pragnesh Jay, et al. "A dynamic distributed constraint satisfaction approach to resource allocation." International Conference on Principles and Practice of Constraint Programming. Springer, Berlin, Heidelberg, 2001.
Miguel, Ian (July 2001). Dynamic Flexible Constraint Satisfaction and its Application to AI Planning (Ph.D. thesis). University of Edinburgh School of Informatics. CiteSeerX 10.1.1.9.6733. hdl:1842/326.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Bodirsky, Manuel; Pinsker, Michael (2011). "Schaefer's theorem for graphs". Proceedings of the 43rd Annual Symposium on Theory of Computing (STOC '11). Association for Computing Machinery. pp. 655–664. arXiv:1011.2894. doi:10.1145/1993636.1993724. ISBN 978-1-4503-0691-1. S2CID 47097319.
Cai, Jin-Yi; Chen, Xi (2012). "Complexity of counting CSP with complex weights". Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC '12). pp. 909–920. arXiv:1111.2384. doi:10.1145/2213977.2214059. ISBN 978-1-4503-1245-5. S2CID 53245129.
Duffy, K.R.; Leith, D.J. (August 2013), "Decentralized Constraint Satisfaction", IEEE/ACM Transactions on Networking, 21(4), vol. 21, pp. 1298–1308, arXiv:1103.3240, doi:10.1109/TNET.2012.2222923, S2CID 11504393

siam.org (Global: low place; English: 6,473^rd place)

epubs.siam.org

Feder, Tomás; Vardi, Moshe Y. (1998). "The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory". SIAM Journal on Computing. 28 (1): 57–104. doi:10.1137/S0097539794266766. ISSN 0097-5397.
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András (January 2019). "Constraint Satisfaction Problems for Reducts of Homogeneous Graphs". SIAM Journal on Computing. 48 (4): 1224–1264. arXiv:1602.05819. doi:10.1137/16M1082974. ISSN 0097-5397.

springer.com (Global: 274^th place; English: 309^th place)

springer.com

"Constraints – incl. option to publish open access". springer.com. Retrieved 2019-10-03.

link.springer.com

Bodirsky, Manuel; Grohe, Martin (2008). "Non-dichotomies in Constraint Satisfaction Complexity". In Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólfsdóttir, Anna; Walukiewicz, Igor (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 5126. Berlin, Heidelberg: Springer. pp. 184–196. doi:10.1007/978-3-540-70583-3_16. ISBN 978-3-540-70583-3.

st-andrews.ac.uk (Global: 1,547^th place; English: 1,410^th place)

cs.st-andrews.ac.uk

Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning, Archived 2009-02-06 at the Wayback Machine Ian Miguel – slides.

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

ics.uci.edu

Dechter, R. and Dechter, A., Belief Maintenance in Dynamic Constraint Networks Archived 2012-11-17 at the Wayback Machine In Proc. of AAAI-88, 37–42.

web.archive.org (Global: 1^st place; English: 1^st place)

Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning, Archived 2009-02-06 at the Wayback Machine Ian Miguel – slides.
MacDonald, Maryellen C., and Mark S. Seidenberg. "Constraint satisfaction accounts of lexical and sentence comprehension." Handbook of Psycholinguistics (Second Edition). 2006. 581–611.
Dechter, R. and Dechter, A., Belief Maintenance in Dynamic Constraint Networks Archived 2012-11-17 at the Wayback Machine In Proc. of AAAI-88, 37–42.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Milano, Michela; Van Hentenryck, Pascal, eds. (2011). Hybrid optimization : the ten years of CPAIOR. International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems. New York: Springer. ISBN 9781441916440. OCLC 695387020.
Barto, Libor; Brady, Zarathustra; Bulatov, Andrei; Kozik, Marcin; Zhuk, Dmitriy (2024-05-15). "Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras". Theoretics. 3 11361. arXiv:2104.11808. doi:10.46298/theoretics.24.14. ISSN 2751-4838.
Feder, Tomás; Vardi, Moshe Y. (1998). "The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory". SIAM Journal on Computing. 28 (1): 57–104. doi:10.1137/S0097539794266766. ISSN 0097-5397.
Bodirsky, Manuel; Kára, Jan (2010-02-08). "The complexity of temporal constraint satisfaction problems". J. ACM. 57 (2): 9:1–9:41. doi:10.1145/1667053.1667058. ISSN 0004-5411.
Bodirsky, Manuel; Jonsson, Peter; Pham, Trung Van (2017-08-02). "The Complexity of Phylogeny Constraint Satisfaction Problems". ACM Trans. Comput. Logic. 18 (3): 23:1–23:42. arXiv:1503.07310. doi:10.1145/3105907. ISSN 1529-3785.
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András (January 2019). "Constraint Satisfaction Problems for Reducts of Homogeneous Graphs". SIAM Journal on Computing. 48 (4): 1224–1264. arXiv:1602.05819. doi:10.1137/16M1082974. ISSN 0097-5397.
Barto, Libor; Kozik, Marcin (2014-01-01). "Constraint Satisfaction Problems Solvable by Local Consistency Methods". J. ACM. 61 (1): 3:1–3:19. doi:10.1145/2556646. ISSN 0004-5411.
Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András (March 2021). "Projective Clone Homomorphisms". The Journal of Symbolic Logic. 86 (1): 148–161. arXiv:1409.4601. doi:10.1017/jsl.2019.23. hdl:2437/268560. ISSN 0022-4812.

Constraint satisfaction problem (English Wikipedia)

aaai.org (Global: 9,352nd place; English: 5,696th place)

aclweb.org (Global: low place; English: 6,793rd place)

arxiv.org (Global: 69th place; English: 59th place)

books.google.com (Global: 3rd place; English: 3rd place)

cambridge.org (Global: 305th place; English: 264th place)

doi.org (Global: 2nd place; English: 2nd place)

drexel.edu (Global: 9,118th place; English: 5,661st place)

cs.drexel.edu

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

jatit.org (Global: low place; English: low place)

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

siam.org (Global: low place; English: 6,473rd place)

epubs.siam.org

springer.com (Global: 274th place; English: 309th place)

springer.com

link.springer.com

st-andrews.ac.uk (Global: 1,547th place; English: 1,410th place)

cs.st-andrews.ac.uk

uci.edu (Global: 3,063rd place; English: 2,041st place)

ics.uci.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

aclweb.org (Global: low place; English: 6,793^rd place)

arxiv.org (Global: 69^th place; English: 59^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

cambridge.org (Global: 305^th place; English: 264^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

drexel.edu (Global: 9,118^th place; English: 5,661^st place)

handle.net (Global: 102^nd place; English: 76^th place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

siam.org (Global: low place; English: 6,473^rd place)

springer.com (Global: 274^th place; English: 309^th place)

st-andrews.ac.uk (Global: 1,547^th place; English: 1,410^th place)

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)