Phase transitions in knowledge compilation: An experimental study

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

Volumn 6695 LNCS, Issue , 2011, Pages 364-366

  Gao, Jian ^a   Yin, Minghao ^a   Xu, Ke ^b  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b BEIHANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL POINTS; EXPERIMENTAL STUDIES; KNOWLEDGE COMPILATION; LOCAL SEARCH ALGORITHM; OVER-CONSTRAINED; RANDOM CONSTRAINT SATISFACTION PROBLEMS; RUNTIMES; SYSTEMATIC SEARCH ALGORITHM; UNDER-CONSTRAINED;

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; LEARNING ALGORITHMS; PHASE TRANSITIONS;

PROBLEM SOLVING;

EID: 79959418170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21581-0_31     Document Type: Conference Paper

References (7)

1. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proc. IJCAI 1991, pp. 331-340. Morgan Kaufmann Publishers, Inc., San Francisco (1991)
2. Achlioptas, D., Naor, A., Peres, Y.: Rigorous location of phase transitions in hard optimization problems. Nature 435, 759-764 (2005)
3. Darwiche, A., Marquis, P.: A Knowledge Compilation Map. J. Artif. Intell. Res. 17, 229-264 (2002)
4. Schrag, R., Crawford, J.M.: Implicates and prime implicates in Random 3-SAT. Artificial Intelligence 81, 199-222 (1996)
5. Darwiche, A.: A Compiler for Deterministic, Decomposable Negation Normal Form. In: Proc. AAAI/IAAI 2002, pp. 627-634. AAAI Press, Menlo Park (2002)
6. Narodytska, N., Walsh, T.: Constraint and Variable Ordering Heuristics for Compiling Configuration Problems. In: Proc. IJCAI 2007, pp. 149-154. Morgan Kaufmann Publishers, Inc., San Francisco (2007)
7. Xu, K., Li, W.: Exact Phase Transitions in Random Constraint Satisfaction Problems. J. Artif. Intell. Res. 12, 93-103 (2000)