On quantified weighted MAX-SAT

Authors:
Amol Dattatraya Mali
Affiliations:
Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, WI
Venue:
Decision Support Systems
Year:
2005

Citing 6
Cited 0

Experimental results on the application of satisfiability algorithms to scheduling problems

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A machine program for theorem-proving

Communications of the ACM
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation

Journal of Automated Reasoning
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce quantified weighted MAX-SAT (Q-W-MAX-SAT) as the problem of assigning values to existentially quantified variables permitted by order of quantification, so that the sum of the weights of satisfied clauses equals or exceeds a given threshold, for all combinations of all values of universally quantified variables. Q-W-MAX-SAT serves as a prototypical conditional decision-making problem in which satisfying all constraints is either impossible or unnecessary or satisfying some constraints is more important than satisfying some other constraints. We report on two branching heuristics and four simplification rules to solve Q-W-MAX-SAT efficiently, along with an empirical evaluation.