A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability.
Jochen MessnerThomas ThieraufPublished in: COCOON (2011)
Keyphrases
- kolmogorov complexity
- inductive inference
- decision procedures
- satisfiability problem
- complexity measures
- computational complexity
- np complete
- presburger arithmetic
- theorem proving
- theorem prover
- propositional logic
- sat problem
- terminological reasoning
- linear logic
- phase transition
- search algorithm
- neural network
- modal logic
- logic programs
- rough sets
- supervised learning
- training data
- satisfiability testing
- data sets