The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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^NP complete.
17 pages, 1 figure

Keywords

Computational Complexity, F.1.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/33044

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9809116
 http://arxiv.org/abs/cs/9809116

Collections

arXiv