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

Authors:
Teresa Alsinet;Ramón Béjar;Alba Cabiscol;Cèsar Fernàndez;Felip Manyà
Affiliations:
-;-;-;-;-
Venue:
CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
Year:
2002

Citing 5
Cited 1

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Local Search Characteristics of Incomplete SAT Procedures

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Balance and filtering in structured satisfiable problems

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Mapping problems with finite-domain variables to problems with boolean variables

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

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.