Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm.
Jianmin ZhangWeixia XuJun ZhangShengYu ShenZhengbin PangTiejun LiJun XiaSikun LiPublished in: IDEAL (2011)
Keyphrases
- search algorithm
- unsatisfiable cores
- max sat
- branch and bound
- tabu search
- hidden structure
- search space
- search strategy
- heuristic function
- search tree
- tree search
- satisfiability problem
- search strategies
- variable ordering
- search methods
- maximum satisfiability
- alpha beta
- first order logic
- lower bound
- boolean satisfiability
- hill climbing
- search problems
- heuristic search
- combinatorial optimization
- search procedure
- game tree
- depth first search
- search heuristics
- sat solvers
- branch and bound algorithm
- simulated annealing
- dynamic programming
- learning algorithm