Transforming inconsistent subformulas in MaxSAT lower bound computation

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

Volumn 5202 LNCS, Issue , 2008, Pages 582-587

  Li, Chu Min ^a,b   Manyà, Felip ^c,d   Mohamedou, Nouredine Ould ^b   Planes, Jordi ^d  

^a HUNAN NORMAL UNIVERSITY   (China)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^c ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^d UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CONTROL THEORY;

LOWER BOUNDS; MAX-SAT; SUBFORMULAS; UNIT PROPAGATIONS;

COMPUTER PROGRAMMING;

EID: 56449118386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_46     Document Type: Conference Paper

References (4)

1. Li, CM., Manyà, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 403414. Springer, Heidelberg (2005)
2. Li, C.M., Manyà, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In: Proceedings AAAI 2006, pp. 86-91 (2006)
3. Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artificial Intelligence 172(2-3), 204-233 (2008)
4. Li, CM., Manyà, F., Planes, J.: New inference rules for Max-SAT Journal of Artificial Intelligence Research 30, 321-359 (2007)