Minimal and Redundant SAT Encodings for the All-Interval-Series Problem

Alsinet, Teresa; Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip

doi:https://doi.org/10.1007/3-540-36079-4_12

View/Open

006639.pdf (118.2Kb)
Sol·licita una còpia

Issue date

2002

Author

Alsinet, Teresa

Béjar Torres, Ramón

Cabiscol i Teixidó, Alba

Fernàndez Camon, César

Manyà Serres, Felip

Suggested citation

Alsinet, Teresa; Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip; . (2002) . Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. Lecture Notes in Computer Science, 2002, vol. 2504, p. 139-144. https://doi.org/10.1007/3-540-36079-4_12.

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.

URI

http://hdl.handle.net/10459.1/57365

DOI

https://doi.org/10.1007/3-540-36079-4_12

Is part of

Lecture Notes in Computer Science, 2002, vol. 2504, p. 139-144