A remark on pseudo proof systems and hard instances of the satisfiability problem.

Jan Maly Moritz Müller

Published in: Math. Log. Q. (2018)

Keyphrases

satisfiability problem
np complete
search algorithm
sat instances
stochastic local search
phase transition
solving hard
decision procedures
temporal logic
random instances
random sat
expert systems
upper bound
model checking
modal logic
theorem proving