Fahiem's reading group

Please wait to be redirected to Ozan's page

We are interested in papers related to various forms of constraint programming.

To join the mailing list, please email Alexandra (alexia at cs). Everyone is welcome to join, but those who attend should participate. Every week one of us will lead the discussion on that week's paper, and everyone will be expected to take a turn.

We are currently meeting in PT378 on Tuesdays at 13:00

Choosing the next paper.
Here are the suggestions:
Jessica:
Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition. Marcelo Finger, Glauber De Bona. IJCAI 2011
Erin:
Automatic Generation of Constraints for Partial Symmetry Breaking. Christopher Jefferson and Karen E. Petrie. CP'11

Pruning Rules for Constrained Optimisation for Conditional Preferences. Nic Wilson and Walid Trabelsi. CP'11

Synthesis of Search Algorithms from High-Level CP Models. Samir A. Mohamed Elsayed and Laurent Michel. CP'11

Ozan:
Planning and Acting in Incomplete Domains. Christopher Weber and Daniel Bryce. ICAPS'11
Alexandra:
Boundary points and resolution. Eugene Goldberg. SAT'09


Sept 29: Discussion led by Jessica, on the following paper:

Ian P. Gent, Chris Jefferson, Ian Miguel, and Peter Nightingale,
Generating Special-purpose Stateless Propagators for Arbitrary Constraints, CP 2010.
Oct 06: Discussion led by Fahiem, on the following paper

Blai Bonet and Malte Helmert,
Strengthening Landmark Heuristics via Hitting Sets, ECAI 2010.
Oct 13: Discussion led by Alexandra, on the following paper:

Robinson, N., Gretton, C.; Pham, D. N.; and Sattar, A,
Partial Weighted MaxSAT for Optimal Planning.
To Appear: Proceedings of the 11th Pacific Rim International Conference on Artificial Intelligence, 2010.
Oct 20: Discussion led by Ozan, on the following paper:

Ruben Duarte Viegas, Marco Correia, Pedro Barahona and Francisco Azevedo
Using Indexed Finite Set Variables for Set Bounds Propagation.
Sixth Ibero-American Artificial Intelligence Conference (IBERAMIA’08), 2008.
Oct 27: Discussion led by Christian, on the following paper:

Knot Pipatsrisawat and Adnan Darwiche
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications.
ECAI-10, Lisbon, Portugal
Nov 10: Discussion led by Erin, on the following paper:

Hubie Chen, A Rendezvous of Logic, Complexity, and Algebra,
ACM Computing Surveys (CSUR) Volume 42 , Issue 1 (December 2009)
Nov 24: Continuing discussion on the following paper:

Hubie Chen, A Rendezvous of Logic, Complexity, and Algebra,
ACM Computing Surveys (CSUR) Volume 42 , Issue 1 (December 2009)
Dec 8: Discussion on the following paper:

Niklas Eén and Niklas Sörensson, Translating Pseudo-Boolean Constraints into SAT
Journal on Satisfiability, Boolean Modeling and Computation (2006)

  • Christian presents Method 1: 5.3 Translation through BDDs
  • Erin presents Method 2: 5.4 Translation through Adder Networks
  • Eric presents Method 3: 5.5 Translation through Sorting Networks
Feb 09: Discussion led by Fahiem, on the following paper:

Peter Jeavons and Justyna Petke, Local consistency and SAT-solvers
CP 2010. Vol. 6308 of Lecture Notes in Computer Science. Pages 398-413.
Feb 16: Discussion led by Jessica, on the following paper:

An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
Li, C., Quan, Z. AAAI 2010.
Feb 23: Discussion led by Erin, on the following paper:

Propagating Conjunctions of AllDifferent Constraints. Bessiere C., Katsirelos G., Narodytska N., Quimper C.G., and Walsh T. AAAI 2010
Mar 2: Discussion led by Alexandra, on the following paper:

Decompositions of All Different, Global Cardinality and Related Constraints. Bessiere C., Katsirelos G., Narodytska N., Quimper C.G., and Walsh T. IJCAI 2009
Mar 9: Discussion led by Ozan, on the following paper:

Symmetries of Symmetry Breaking Constraints. George Katsirelos and Toby Walsh. Proceedings of ECAI-2010, 2010.
Mar 16: Discussion led by Jessica, on the following paper:

Upper Bounds on the Number of Solutions of Binary Integer Programs. Jain, S., Kadioglu, S., Sellmann, M. CPAIOR 2010.
Mar 23: Discussion led by Alexandra, on the following paper:

Improved Local Search for Circuit Satisfiability. A. Belov and Z.Stachniak. Proceedings of SAT 2010
Mar 30: Discussion led by Erin, on the following paper:

A New Hybrid Tractable Class of Soft Constraint Problems. Martin C. Cooper and Stanislav Zivny. Proceedings of CP 2010
Apr 6: Discussion led by Ozan, on the following paper:

A Simplifier for Propositional Formulas with Many Binary Clauses. Ronen I. Brafman. IJCAI'01
Apr 13: Discussion led by Erin, on the following paper:

Automatically Exploiting Subproblem Equivalence in Constraint Programming. G. Chu, M. Garcia de la Banda, and P.J. Stuckey. CPAIOR 2010
Apr 20: Discussion led by Alexandra, on the following paper:

Learning in Local Search. Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, and Lakhdar Sais. ICTAI 2009
May 4: Discussion led by Jessica, on the following paper:

Automatically Configuring Algorithms for Portfolio-Based Selection by Lin Xu, Holger Hoos and Kevin Leyton-Brown, AAAI 2010.
May 25: Discussion led by Ozan, on the following paper:

Symmetry and Satisfiability: An Update. Hadi Katebi, Karem A. Sakallah, Igor L. Markov. SAT 2010
June 1: Discussion led by Alexandra, on the following paper:

Interpolation and SAT-based Model Checking. K. L. McMillan. CAV 2003.
June 8: Discussion led by Erin, on the following paper:

Maintaining State in Propagation Solvers. Raphael M. Reischuk, Christian Schulte, Peter J. Stuckey, Guido Tack. CP'09
June 22: Discussion led by Jessica, on the following paper:

Efficient CNF Simplification based on Binary Implication Graphs. Marijn Heule, Matti Jarvisalo, and Armin Biere. SAT'11
July 05: SAT'2011 and ICAPS'2011 overviews
July 12: Discussion led by Ozan, on the following paper:

Heuristics for Planning with SAT and Expressive Action Definitions. Jussi Rintanen. ICAPS'11
July 27: IJCAI'2011 overview
Aug 3: Discussion led by Fahiem, on the following paper:

Planning as Satisfiability with Relaxed ࢛-Step Plans. Martin Wehrle and Jussi Rintanen. AI'07
Sept 27: CP'11 overview
Oct 4: Discussion led by Fahiem, on the following paper:

Circuit Complexity and Decompositions of Global Constraints. Christian Bessiere, George Katsirelos, Nina Narodytska, Toby Walsh. IJCAI'09
Oct 12: Continuing discussion on the following paper:

Circuit Complexity and Decompositions of Global Constraints. Christian Bessiere, George Katsirelos, Nina Narodytska, Toby Walsh. IJCAI'09
Oct 18: Discussion led by Alexandra, on the following paper:

Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation.
M.A.Hakim Newton, Duc-Nghia Pham, Abdul Sattar and Michael Maher. CP 2011
Oct 25: Discussion led by Erin, on the following paper:

Synthesis of Search Algorithms from High-level CP Models. Samir A. Mohamed Elsayed, Laurent Michel. CP 2011
Dec 6: Discussion led by Jessica, on the following paper:

Lifted Probabilistic Inference by First-Order Knowledge Compilation. Guy Van den Broeck, Nima Taghipour, Wannes Meert, Jesse Davis, Luc De Raedt. IJCAI 2011
Dec 13: Discussion led by Ozan, on the following paper:

Directed Search for Generalized Plans Using Classical Planners. Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang. ICAPS'11
Dec 20: Discussion led by Alexandra, on the following paper:

Boosting Local Search Thanks to CDCL. Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure and Lakhdar Sais. International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR'10