TY - GEN
T1 - Phase transitions in knowledge compilation
T2 - 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011
AU - Gao, Jian
AU - Yin, Minghao
AU - Xu, Ke
PY - 2011
Y1 - 2011
N2 - Phase transitions, as a kind of well-known phenomena in artificial intelligence, have attracted a great amount of attention in recent years [1,2]. Many NP-complete problems, such as random SAT and random Constraint Satisfaction Problems (CSPs), have a critical point that separates overconstrained and underconstrained regions, and soluble-to-insoluble phase transition occurs at this critical point, which is always accompanied with the transitions of CPU runtimes. Both systematic search algorithms and local search algorithms suffer an easy-hard-easy pattern when solving those problems.
AB - Phase transitions, as a kind of well-known phenomena in artificial intelligence, have attracted a great amount of attention in recent years [1,2]. Many NP-complete problems, such as random SAT and random Constraint Satisfaction Problems (CSPs), have a critical point that separates overconstrained and underconstrained regions, and soluble-to-insoluble phase transition occurs at this critical point, which is always accompanied with the transitions of CPU runtimes. Both systematic search algorithms and local search algorithms suffer an easy-hard-easy pattern when solving those problems.
UR - https://www.scopus.com/pages/publications/79959418170
U2 - 10.1007/978-3-642-21581-0_31
DO - 10.1007/978-3-642-21581-0_31
M3 - 会议稿件
AN - SCOPUS:79959418170
SN - 9783642215803
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 364
EP - 366
BT - Theory and Application of Satisfiability Testing - 14th International Conference, SAT 2011, Proceedings
Y2 - 19 June 2011 through 22 June 2011
ER -