Abstract
The SAT encodings defined so far for the all-interval-series (ais) problem are very hard for local search but rather easy for systematic algorithms. We define different SAT encodings for the ais problem and provide experimental evidence that this problem can be efficiently solved with local search methods if one chooses a suitable SAT encoding.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. H. Hoos. Stochastic Local Search-Methods, Models, Applications. PhD thesis, Department of Computer Science, Darmstadt University of Technology, 1998.
H. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, and M. Stickel. Balance and filtering in structured satisfiable problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’01, Seattle/WA, USA, 351–358. Morgan Kaufmann, 2001
C. M. Li, and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’97, Nagoya, Japan, 366–371. Morgan Kaufmann, 1997.
D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI’97, Providence/RI, USA, pages 321–326. AAAI Press, 1997.
D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proceedings of the 17th National Conference on Artificial Intelligence, AAAI-2000, Austin/TX, USA, pages 297–302. AAAI Press, 2000.
B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI’94, Seattle/WA, USA, pages 337–343. AAAI Press, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alsinet, T., Béjar, R., Cabiscol, A., Fernàndez, C., Manyà, F. (2002). Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. In: Escrig, M.T., Toledo, F., Golobardes, E. (eds) Topics in Artificial Intelligence. CCIA 2002. Lecture Notes in Computer Science(), vol 2504. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36079-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-36079-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00011-2
Online ISBN: 978-3-540-36079-7
eBook Packages: Springer Book Archive