Optimal satisfiability for propositional calculi and constraint satisfaction problems

Authors:
Steffen Reith;Heribert Vollmer
Affiliations:
LengfelderStr. 35b, D-97078 Würzburg, Germany;Fachgebiet Theoretische Informatik, Institut für Informationssysteme, Universität Hannover, Appelstraße 4, D-30167 Hannover, Germany
Venue:
Information and Computation
Year:
2003

Citing 12
Cited 8

More complicated questions about maxima and minima, and some closures of NP

Theoretical Computer Science
The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Generalizations of Opt P to the polynomial hierarchy

Theoretical Computer Science
Complexity classes of optimization functions

Information and Computation
A dichotomy theorem for maximum generalized satisfiability problems

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems

Information and Computation
A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Complexity classifications of boolean constraint satisfaction problems

Complexity classifications of boolean constraint satisfaction problems
On Different Reducibility Notions for Function Classes

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Constraint Satisfaction: The Approximability of Minimization Problems

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

SIGACT news complexity theory column 43

ACM SIGACT News
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?

Complexity of Constraints
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments

Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of generalized satisfiability for linear temporal logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Nonuniform Boolean constraint satisfaction problems with cardinality constraint

ACM Transactions on Computational Logic (TOCL)
Generalized modal satisfiability

Journal of Computer and System Sciences
The tractability of model checking for LTL: The good, the bad, and the ugly fragments

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulas for different restricted classes of formulas. It turns out that for each class from our framework, these problems are 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 PNP complete.