Constructive Disjunction Revisited

@inproceedings{Org1996ConstructiveDR,
  title={Constructive Disjunction Revisited},
  author={Jj Org and W Urtz and Tobias M Uller},
  year={1996}
}
Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where constructive disjunction provides for stronger pruning and where it fails to do so. For several problems… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
3 Extracted Citations
18 Extracted References
Similar Papers

Referenced Papers

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

DFKI Oz Documentation Series German Research Center for Artiicial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken

  • R Smolka, Treinen
  • DFKI Oz Documentation Series German Research…
  • 1995

Using Oz for college time tabling

  • M Henz, J Urtz
  • International Conference on the Practice and…
  • 1995

Similar Papers

Loading similar papers…