Extending unit propagation look-ahead of DPLL procedure

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3157, Issue , 2004, Pages 173-182

  Anbulagan, ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; RANDOM PROCESSES; SEARCH ENGINES; SET THEORY; TREES (MATHEMATICS); BENCHMARKING;

CONJUNCTIVE NORMAL FORM (CNF); DAVIS-PUTNAM-LOGEMANN-LOVELAND (DPLL); DYNAMIC VARIABLE FILTERING (DVF); UNIT PROPAGATION; BRANCHING RULES; DAVIS-PUTNAM-LOGEMANN-LOVELAND; DPLL PROCEDURE; DYNAMIC VARIABLE FILTERING; FILTERING PROCESS; ITS EFFICIENCIES; VARIABLE ORDER;

PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE;

EID: 22944455182     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-28633-2_20     Document Type: Conference Paper

References (10)

1. Bessière, C., Chmeiss, A., and Sais, L. Neighborhood-based Variable Ordering Heuristics for the Constraint Satisfaction Problem. In Proceedings of Seventh International Conference on Principles and Practice of Constraint Programming, 2001, Paphos, Cyprus, pp. 565-569.
2. Crawford, J. M., and Auton, L. D. Experimental Results on the Crossover Point in Random 3SAT. Artificial Intelligence Journal, 1996, Vol. 81, no. 1-2.
3. Davis, M., Logemann, G. and Loveland, D. A Machine Program for Theorem Proving. Communication of ACM 5 (1962), pp. 394-397.
4. Dubois, O., and Dequen, G. A Backbone-search Heuristic for Efficient Solving of Hard 3-SAT Formulae. In Proceedings of 17th International Joint Conference on Artificial Intelligence, 2001, Seattle, Washington, USA.
5. Freeman, J. W. Improvements to Prepositional Satisfiability Search Algorithms. Ph.D. Dissertation, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, (1995).
6. Fujita, M., Slaney, J., and Bennett, F. Automatic Generation of Some Results in Finite Algebra. In Proceedings of 13th International Joint Conference on Artificial Intelligence, 1993, Chambery, France, pp.
7. Hooker, J. N., Vinay, V. Branching Rules for Satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.
8. Jeroslow, R., Wang, J. Solving Prepositional Satisfiability Problems. Annals of Mathematics and AI, 1, 1990, pp. 167-187.
9. Le Berre, D. Exploiting the Real Power of Unit Propagation Lookahead. In Proceedings of Workshop on the Theory and Applications of Satisfiability Testing, 2001, Boston University, MA, USA.
10. Li, C. M., and Anbulagan. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proceedings of 15th International Joint Conference on Artificial Intelligence, 1997, Nagoya, Aichi, Japan, pp. 366-371.