论文信息 - The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae

The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae

We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem is either polynomial time solvable or complete for OptP . We also consider the problem of deciding if in the optimal assignment the largest variable gets value 1. We show that this problem is either in P or P complete.

Heribert Vollmer | Steffen Reith

[1] Nadia Creignou,et al. Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[2] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.

[3] David P. Williamson,et al. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.

[4] Heribert Vollmer. On Different Reducibility Notions for Function Classes , 1994, STACS.

[5] Nadia Creignou,et al. A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[6] Ronald Fagin. Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[7] Heribert Vollmer,et al. Complexity Classes of Optimization Functions , 1995, Inf. Comput..

[8] Nadia Creignou,et al. On Generating All Solutions of Generalized Satisfiability Problems , 1997, RAIRO Theor. Informatics Appl..

[9] Mark W. Krentel. Generalizations of Opt P to the Polynomial Hierarchy , 1992, Theor. Comput. Sci..

[10] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

[11] Luca Trevisan,et al. Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.