Using Boolean Constraint Propagation for sub-clauses deduction

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

Volumn 3709 LNCS, Issue , 2005, Pages 757-761

  Darras, S ^a   Dequen, G ^a   Devendeville, L ^a   Mazure, B ^b   Ostrowski, R ^b   Sais L ^b  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; GRAPH THEORY; PROBLEM SOLVING;

BOOLEAN CONSTRAINT PROPAGATION (BCP); PRETREATMENT PROCESS; SAT SOLVERS; SUBCLAUSES DEDUCTION;

BOOLEAN ALGEBRA;

EID: 33646184396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_59     Document Type: Conference Paper

References (7)

1. Kautz, H.A., Selman, B.: Planning as Satisfiability. In: Proc. of ECAI'92, Vienna, Austria (1992) 359-363
2. Marques-Silva, J.P., Sakallah, K.A.: Boolean Satisfiability in Electronic Design Automation. In: In Proc of DAC'00, Los Angeles, USA (2000) 675-680
3. Biere, A., Clarke, E., Raimi, R., Zhu, Y.: Verifying Safety Properties of a PowerPC Microprocessor Using Symbolic Model Checking without BDDs. In: CAV'99. Volume 1633 of Lecture Notes in Computer Science., Trento, Italy (1999) 60-72
4. Williams, R., Gomes, C., Selman, B.: Backdoors To Typical Case Complexity. In: IJCAI'03, Acapulco, Mexico (2003) 1173-1178
5. Li, C.M.: Equivalency reasoning to solve a class of hard sat problems. Information Processing Letters 76 (2000) 75-81
6. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Journal of the Association for Computing Machinery 5 (1962) 394-397
7. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: In Proc. of ICCAD'01, San Jose, CA, USA (2001) 279-285