Inference Rules in Local Search for Max-SAT.

André Abramé Djamal Habet

Published in: ICTAI (2012)

Keyphrases

inference rules
max sat
max sat solver
tabu search
stochastic local search
search algorithm
random sat instances
guided local search
propositional satisfiability
weighted max sat

sat solvers
simulated annealing
branch and bound algorithm
metaheuristic
branch and bound
first order logic
lower bound
combinatorial optimization
search space
satisfiability problem

theorem prover
genetic algorithm
sat problem
scheduling problem
modal logic
boolean satisfiability
optimal solution
constraint satisfaction
maximum satisfiability
truth values

search procedure
conditional probabilities
horn clauses
linear programming
optimization problems
orders of magnitude
randomly generated
search strategies
search strategy