Set-theoretic duality: A fundamental feature of combinatorial optimisation

  title={Set-theoretic duality: A fundamental feature of combinatorial optimisation},
  author={John Slaney},
The duality between conflicts and diagnoses in the field of diagnosis, or between plans and landmarks in the field of planning, or between unsatisfiable cores and minimal co-satisfiable sets in SAT or CSP solving, has been known for many years. Recent work in these communities (Davies and Bacchus, CP 2011, Bonet and Helmert, ECAI 2010, Haslum et al., ICAPS 2012, Stern et al., AAAI 2012) has brought it to the fore as a topic of current interest. The present paper lays out the set-theoretic basis… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 17 references

Whitehouse , ‘ An effective and simple heuristic for the set covering problem ’

Guanghui Lan, Gail W. DePuy, E. Gary
European Journal of Operational Research • 2007

Slaney and Sylvie Thiébaux , ‘ Blocks world revisited ’

K. John
, Artificial Intelligence • 2001

Similar Papers

Loading similar papers…