The Monotone Satisfiability Problem with Bounded Variable Appearances.

Andreas Darmann Janosch Döcker Britta Dorn

Published in: Int. J. Found. Comput. Sci. (2018)

Keyphrases

satisfiability problem
np complete
finite domain
temporal logic
search algorithm
phase transition
pspace complete
stochastic local search algorithms
sat problem
decision procedures
stochastic local search
model checking
appearance model
sat instances
boolean functions
bounded treewidth
lower bound