A Clause Tableau Calculus for MinSAT.

Chu Min Li Felip Manyà Joan Ramon Soler

Published in: CCIA (2016)

Keyphrases

combinatorial optimization problems
tableau calculus
combinatorial auctions
unsatisfiable cores
branch and bound algorithm
sat problem
description logics
cnf formula
boolean formula

boolean satisfiability
max sat
combinatorial optimization
optimization problems
metaheuristic
knowledge base
sat solvers
search space
knapsack problem

ant colony optimization
clause learning
sat instances
lower bound
minimal models
optimal solution
knowledge representation
traveling salesman problem
theorem prover

learning algorithm
objective function
computational complexity
constraint satisfaction problems
tabu search
randomly generated
satisfiability problem
approximation algorithms
resource allocation