Local-search techniques for propositional logic extended with cardinality constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 495-509

  Liu, Lengning ^a   Truszczyński, Miroslaw ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LOCAL SEARCH (OPTIMIZATION); MODEL CHECKING; MODELING LANGUAGES; RECONFIGURABLE HARDWARE;

CARDINALITY CONSTRAINTS; EXTENDED LANGUAGES; INDIRECT METHODS; LOCAL SEARCH TECHNIQUES; MODEL CONSTRAINTS; PROPOSITIONAL LOGIC; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY SOLVERS;

FORMAL LOGIC;

EID: 35248881454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_34     Document Type: Article

References (14)

1. F.A. Aloul, A. Ramani, I. Markov, and K. Sakallah. Pbs: a backtrack-search pseudo-boolean solver and optimizer. In Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability, pages 346-353, 2002.
2. P. Barth. A davis-putnam based elimination algorithm for linear pseudo-boolean optimization. Technical report, Max-Planck-Institut für Informatik, 1995. MPI-I-95-2-003.
3. B. Benhamou, L. Sais, , and P. Siegel. Two proof procedures for a cardinality based language in propositional calculus. In Proceedings of STACS-94, pages 71-82. 1994.
4. H.E. Dixon and M.L. Ginsberg. Inference methods for a pseudo-boolean satisfiability solver. In The 18th National Conference on Artificial Intelligence (AAAI-2002), 2002.
5. D. East and M. Truszczyński. Propositional satisfiability in answer-set programming. In Proceedings of Joint German/Austrian Conference on Artificial Intelligence, KI'2001, volume 2174, pages 138-153. Lecture Notes in Artificial Intelligence, Springer Verlag, 2001. Full version submitted for publication (available at http://xxx.lanl.gov/abs/cs.L0/0211033).
6. E. Goldberg and Y. Novikov. Berkmin: a fast and robust sat-solver. In DATE-2002, pages 142-149. 2002.
7. C.M. Li. Integrating equivalency reasoning into davis-putnam procedure. In Proccedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), pages 291-296, 2000.
8. C.M. Li and M. Anbulagan. Look-ahead versus look-back for satisfiability problems. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, 1997.
9. J.P. Marques-Silva and K.A. Sakallah. GRASP: A new search algorithm for satisfiability. IEEE Transactions on Computers, 48:506-521, 1999.
10. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient SAT solver. In Proceedings of the Design Automation Conference (DAC), 2001.
11. S.D. Prestwich. Randomised backtracking for linear pseudo-boolean constraint problems. In Proceedings of the 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, CPAIOR-02, pages 7-20, 2002.
12. B. Selman, H.A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Seattle, USA, 1994.
13. J.P. Walser. Solving linear pseudo-boolean constraints with local search. In Proceedings of the 11th Conference on Artificial Intelligence, AAAI-97, pages 269-274. AAAI Press, 1997.
14. H. Zhang. SATO: an efficient propositional prover. In Proceedings of the International Conference on Automated Deduction (CADE-97), pages 308-312, 1997. Lecture Notes in Artificial Intelligence, 1104.