Phase Transitions in Knowledge Compilation: an Experimental Study

04/05/2011
by   Jian Gao, et al.
0

Phase transitions in many complex combinational problems have been widely studied in the past decade. In this paper, we investigate phase transitions in the knowledge compilation empirically, where DFA, OBDD and d-DNNF are chosen as the target languages to compile random k-SAT instances. We perform intensive experiments to analyze the sizes of compilation results and draw the following conclusions: there exists an easy-hard-easy pattern in compilations; the peak point of sizes in the pattern is only related to the ratio of the number of clauses to that of variables when k is fixed, regardless of target languages; most sizes of compilation results increase exponentially with the number of variables growing, but there also exists a phase transition that separates a polynomial-increment region from the exponential-increment region; Moreover, we explain why the phase transition in compilations occurs by analyzing microstructures of DFAs, and conclude that a kind of solution interchangeability with more than 2 variables has a sharp transition near the peak point of the easy-hard-easy pattern, and thus it has a great impact on sizes of DFAs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2011

An Analysis of Phase Transition in NK Landscapes

In this paper, we analyze the decision version of the NK landscape model...
research
09/19/2016

On the Phase Transition of Finding a Biclique in a larger Bipartite Graph

We report on the phase transition of finding a complete subgraph, of spe...
research
07/01/1997

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty

The easy-hard-easy pattern in the difficulty of combinatorial search pro...
research
04/30/2014

Phase transitions in semisupervised clustering of sparse networks

Predicting labels of nodes in a network, such as community memberships o...
research
04/16/2000

Exact Phase Transitions in Random Constraint Satisfaction Problems

In this paper we propose a new type of random CSP model, called Model RB...
research
06/08/2018

Maximizing the Number of Satisfied L-clauses

The k-SAT problem for Ł-clausal forms has been found to be NP-complete i...
research
10/08/2018

Problem Solving at the Edge of Chaos: Entropy, Puzzles and the Sudoku Freezing Transition

Sudoku is a widely popular NP-Complete combinatorial puzzle whose prospe...

Please sign up or login with your details

Forgot password? Click here to reset