Satisfiability Decay along Conjunctions of Pseudo-Random Clauses.
Eli ShamirPublished in: Log. J. IGPL (2006)
Keyphrases
- pseudorandom
- cnf formula
- horn clauses
- propositional theories
- conjunctive normal form
- boolean formula
- uniformly distributed
- disjunctive normal form
- random sat
- satisfiability problem
- random number
- propositional formulas
- logical implication
- propositional logic
- first order logic
- secret key
- computational problems
- np complete
- random numbers
- sat problem
- computational properties
- phase transition
- unit propagation
- max sat
- logic programs
- search space
- user specific
- functional dependencies
- sat solvers
- clause learning
- satisfiability testing
- computational complexity
- inference rules
- refinement operators
- description logics
- random sat instances
- polynomial size
- davis putnam
- stochastic local search
- lightweight
- data analysis
- real time