Minimum satisfiability and its applications

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 605-610

  Li, Chu Min ^a,b   Zhu, Zhu ^b   Manyà, Felip ^c   Simon, Laurent ^d  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^c ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^d CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COMBINATORIAL AUCTION PROBLEMS; COMBINATORIAL OPTIMIZATION PROBLEMS; EMPIRICAL EVALUATIONS; ITS APPLICATIONS; MAXIMUM SATISFIABILITY PROBLEMS; SATISFIABILITY; SATISFIABILITY PROBLEMS;

ALGORITHMS; FORMAL LOGIC;

PROBLEM SOLVING;

EID: 84864976022     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-108     Document Type: Conference Paper

References (17)

1. Adi Avidor and Uri Zwick. Approximating min 2-sat and min 3-sat. Theory of Computing Systems, 38(3):329-345, 2005.
2. M. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki, and T. Werner. Soft arc consistency revisited Artificial Intelligence, (7-8):449-478, 2010
3. Yuzo Fujishima, Kevin Leyton-Brown, and Yoav Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In IJCAI, pages 548-553, 1999.
4. Federico Heras, Javier Larrosa, Simon de Givry, and Thomas Schiex. 2006 and 2007 Max-SAT evaluations: Contributed instances. JSAT, 4(2-4):239-250, 2008.
5. Rajeev Kohli, Ramesh Krishnamurti, and Prakash Mirchandani. The minimum satisfiability problem. SIAM J. Discrete Mathematics, 7(2):275-283, 1994.
6. J. Konc and D. Janezic. An improved branch and bound algorithm for the maximum clique problem. Communications in Mathematical and in Computer Chemistry, 58:569-590, 2007.
7. Adrian Kuegel. Improved exact solver for the Weighted MAX-SAT problem. In Workshop Pragmatics of SAT, 2010.
8. Kevin Leyton-Brown, Mark Pearson, and Yoav Shoham. Towards a universal test suite for combinatorial auction algorithms. In ACM Conference on Electronic Commerce, pages 66-76, 2000.
9. Chu Min Li and Anbulagan, Heuristics Based on Unit Propagation for Satisfiability Problems. In Proceedings of IJCAI, pages 366-371,
10. Chu Min Li and F. Manyà. MaxSAT, hard and soft constraints. In Armin Biere, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, pages 613-631. IOS Press, 2009.
11. Chu Min Li and Zhe Quan. Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In ICTAI, pages 344-351, 2010.
12. Chu Min Li and Zhe Quan. An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. In AAAI, pages 128-133, 2010.
13. Chu Min Li, Felip Manyà, and Jordi Planes. New inference rules for Max-SAT. Journal of Artificial Intelligence Research, 30:321-359, 2007.
14. Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, and Jordi Planes. Resolution-based lower bounds in MaxSAT. Constraints, 15(4):456-484, 2010.
15. Chu Min Li, Felip Manyà, Zhe Quan, and Zhu Zhu. Exact MinSAT solving. In SAT, pages 363-368, 2010.
16. Han Lin, Kaile Su and Chu Min Li. Within-Problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. In AAAI, pages 351-356, 2008.
17. M. V. Marathe and S. S. Ravi. On approximation algorithms for the minimum satisfiability problem. Information Processing Letters, 58:23-29, 1996.