Solving Periodic Event Scheduling Problems with SAT
edited by: David Hutchison, Takeo Kanade, Josef Kittler, Jon M. Kleinberg, Friedemann Mattern, John C. Mitchell, Moni Naor, Oscar Nierstrasz, C. Pandu Rangan, Bernhard Steffen, Madhu Sudan, Demetri Terzopoulos, Doug Tygar, Moshe Y. Vardi, Gerhard Weikum, He Jiang, Wei Ding, Moonis Ali, Xindong Wu
In Advanced Research in Applied Artificial Intelligence - 25th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2012, Vol. 7345 (2012), pp. 166-175, doi:10.1007/978-3-642-31087-4_18 Key: citeulike:11239880
Formatted Citation
Show HTML
Likes (beta)
This copy of the article hasn't been liked by anyone yet.
View FullText article
Abstract
In this paper, periodic event scheduling problems (PESP) are encoded as satisfiability problems (SAT) and solved by a state-of-the-art SAT solver. Two encodings, based on direct and order encoded domains, are presented. An experimental evaluation suggests that the SAT-based approach using order encoding outperforms constraint-based PESP solvers, which until now were considered to be the best solvers for PESP. This opens the possibility to model significantly larger real-world problems.
chsticksel's tags for this article
Citations (CiTO)
No CiTO relationships defined
There are no reviews yet
