|
|
Handouts
Papers Discussed
- Dispensable
Instantiations in Constraint Satisfaction Problems
Freuder, Grimes, Wallace.
International Workshop on "Experimental Evaluation
of Algorithms for Solving Problems with Combinatorial Explosion" (21st RCRA).
2014.
- Generalzing
Constraint Satisfaction on Trees: Hybrid Tractability and Variable Elimination
Cooper, Jeavons, Salamon
AIJ, 2010
- Beyond Consistency
and Substitutability
Cooper
CP 2014
- On Broken Triangles
Cooper, El Mouelhi, Terrioux, Zanuttini
CP 2014. (Best paper award)
- A
Hybrid Tractable Class for Non-Binary CSPs
El Mouelhi, Jegou, Terrioux
ICTAI 2013.
- On the Desirability of Acyclic Database Schemes
Beeri, Fagin, Maier, Yannakakis
JACM, 1983.
- Some Characterizations of gamma and beta-acyclicity of Hypergraphs
Duris
2008, also in Iformation Processing Letters, August 2012
- The
Extandable-Triple Property: A New CSP Tractable Class Beyond BTP
Jegou, Terrioux
AAAI 2015.
- A
Hidden Tractable Classes: From Theory to Practice
El Mouelhi, Jegou, Terrioux
ICTAI 2014.
-
A Unifying Framework for Structural Properties of CSPs: Definitions,
Complexity, Tractability
Bordeaux, Cadoli, Mancini
JAIR, 2008
Scribe Minutes
- Dispensable Instantiations
Robert's minutes
and figures
Berthe's scribble
- DBTP
Tony's minutes
and figures
- The Broken Triangle (AIJ 2010)
Nate's minutes.
- On Broken Triangles (CP)
Daniel's minutes
and figures
- Chris: Extendable Triple
Chris's minutes
and figures
- Hidden tractable classes
Robert's minutes.
- Tightness and Looseness
Tony's minutes
and figures
- Framework for Structural Properties of CSPs
Chris's minutes.
Last modified: Sun May 5 23:53:13 CDT 2013
|