Importance of variables semantic in CNF encoding of cardinality constraints

SARA 2009 - Proceedings, 8th Symposium on Abstraction, Reformulation and Approximation

Volumn , Issue , 2009, Pages 10-17

  Anbulagan, ^a   Grastien, Alban ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE CASE; CARDINALITY CONSTRAINTS; DISCRETE EVENTS; DPLL ALGORITHM; ENCODINGS; PROBLEM INSTANCES; SATISFIABILITY;

ABSTRACTING; ALGORITHMS; ENCODING (SYMBOLS); SEMANTICS;

PROBLEM SOLVING;

EID: 84890261698     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Bailleux, O. and Boufkhad, Y. 2003. Efficient CNF Encoding of Boolean Cardinality Constraints. In Proc. of the 9th CP, 108-122.
2. Biittner, M., and Rintanen, J. 2005. Satisfiability planning with constraints on the number of actions. In Proc. of the 15th CAPS, 292-299.
3. Een, N., and Sdrensson, N. 2004. An Extensible SAT- solver. In Proc. of 6th SAT, volume LNCS 2919, 502-518.
4. Een, N. and Sdrensson, N. 2006. Translating Pseudo- Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2:1-26.
5. Ernst, M.; Millstein, T.; and Weld, D. 1997. Automatic SAT-Compilation of Planning Problems. In Proc. of the J5th IJCAI, 1169-1177.
6. Grastien, A.; Anbulagan; Rintanen, J.; and Kelareva, E. 2007. Diagnosis of Discrete-Event Systems using Satisfiability Algorithms. In Proc. of the 22nd AAAI, 305-310.
7. Ishtaiwi, A.; Thornton, J.; Anbulagan; Sattar, A.; and Pham, D. N. 2006. Adaptive Clause Weight Redistribution. In Proc. of the 12th CP, 229-243.
8. Lamperti, G., and Zanella, M. 2003. Diagnosis of Active Systems. Kluwer Academic Publishers.
9. Marques-Silva, J., and Lynce, I. 2007. Towards Robust CNF Encodings of Cardinality Constraints. In Proc. of the 13th CP, 483-497.
10. Pipatsrisawat, K., and Darwiche, A. 2007. Rsat 2.0: Sat solver description. Technical Report D-153, Automated Reasoning Group, Computer Scicnce Department, UCLA.
11. Prestwich, S. 2007. Variable Dependency in Local Search: Prevention is Better than Cure. In Proc. of the 10th SAT, volume LNCS 4501, 107-120.
12. Sinz, C. 2005. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In Proc. of the 11th CP, 827-831.
13. Warners, J. 1998. A Linear-time Transformation of Linear Inequalities into Conjunctive Normal Form. Information Processing Letters 68:63-69.
14. Wei, W. and Selman, B. 2002. Accelerating Random Walks. In Proc. of the 8th CP, 216-232.