{"id":75,"date":"2006-05-31T19:25:12","date_gmt":"2006-05-31T23:25:12","guid":{"rendered":"http:\/\/mat.tepper.cmu.edu\/blog\/?p=61"},"modified":"2006-05-31T19:25:12","modified_gmt":"2006-05-31T23:25:12","slug":"constraint-programming-and-google-scholar","status":"publish","type":"post","link":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/2006\/05\/31\/constraint-programming-and-google-scholar\/","title":{"rendered":"Constraint Programming and Google Scholar"},"content":{"rendered":"

I am in Cork, Ireland for this year’s CP\/AI-OR conference<\/a>. This is a conference series that revolves around issues that constraint programming and operations research have in common: integration of techniques, applications, software systems and so on. I really like this conference series (disclosure: I am on the steering committee for the conference, so I would like it to be successful!). Like many computer science conferences, and unlike most OR conferences, this is a competitive conference with a rejection rate close to 80%. So the quality is high, but the number of participants is somewhat low: nothing like rejecting a submission to discourage participation! But the small size (about 60) means an opportunity to talk to lots of people.<\/p>\n

Being in Ireland, we naturally ended the evening with a pint of beer (Murphy’s or Guinness for the cool people, lagers for the others), and we started discussing the most referenced papers in constraint programming or satisfiability (according to Google Scholar: see my OR version <\/a>of this). Checking a few possibilities, here are some data, though I think this can be improved:<\/p>\n

“A Computing Procedure for Quantification Theory” by Davis and Putnam, 1002 references (the fundamental algorithm for SAT solvers)
\n“Chaff: Engineering an Efficient SAT Solver” by Moskewicz, Madigan, Zhao, Zhang, and Malik: 880 references<\/p>\n

“Partial Constraint Satisfaction” by Freuder and Wallace, 447 references<\/p>\n

“Generalized Arc Consistency for Global Cardinality Constraint” by Regin (my favorite!), 128 references<\/p>\n

Constraint Programming in Logic Programming, van Hentenryck 731 (book)<\/p>\n

“Temporal Constraint Networks” by Dechter, Meiri, and Pearl, 710 references<\/p>\n

Again, you are welcome to post other high ranking papers and books!<\/p>\n

Update June 6, 2006<\/strong><\/p>\n

Both Pascal van Hentenryck and Diego Olivier Fernandez Pons point out that R\u00e9gin’s most cited paper requires the “\u00e9” to find. I wondered where the alldiff paper went!<\/p>\n

A filtering algorithm for constraints of difference in CSPs
\nJC R\u00e9gin – Proceedings of the twelfth national conference on Artificial Intelligence has 285 cites in Google scholar.<\/p>\n

It is interesting that Google Scholar seems smart enough to combine papers with slightly different spellings: there are no cites without the “\u00e9” of the above, and no cites with an “\u00e9” in the gcc paper cited earlier.<\/p>\n","protected":false},"excerpt":{"rendered":"

I am in Cork, Ireland for this year’s CP\/AI-OR conference. This is a conference series that revolves around issues that constraint programming and operations research have in common: integration of techniques, applications, software systems and so on. I really like this conference series (disclosure: I am on the steering committee for the conference, so I … Continue reading “Constraint Programming and Google Scholar”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14],"tags":[],"class_list":["post-75","post","type-post","status-publish","format-standard","hentry","category-constraint-programming"],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/posts\/75","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/comments?post=75"}],"version-history":[{"count":0,"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/posts\/75\/revisions"}],"wp:attachment":[{"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/media?parent=75"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/categories?post=75"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/wp-json\/wp\/v2\/tags?post=75"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}