On Solving Soft Temporal Constraints Using SAT Techniques

@inproceedings{Sheini2005OnSS,
  title={On Solving Soft Temporal Constraints Using SAT Techniques},
  author={Hossein M. Sheini and Bart Peintner and Karem A. Sakallah and Martha E. Pollack},
  booktitle={CP},
  year={2005}
}
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’ decomposition and adopting SAT techniques. In our approach, each temporal constraint is replaced by a Boolean indicator variable and the decomposed problem is solved by a tightly integrated STP solver and SAT solver. Several hybridization techniques that take advantage of each solver’s strengths are introduced. Finally… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
17 Citations
20 References
Similar Papers

References

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

Tractable pareto optimal optimization of temporal preferences

  • L. Khatib, P. Morris, R. Morris, K. B. Venable
  • 18th International Joint Conference on Artificial…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…