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.
منابع مشابه
On Quantified Propositional Logics and the Exponential Time Hierarchy
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the e...
متن کاملPublic announcements, public assignments and the complexity of their logic
We study the extension of public announcement logic PAL by public assignments, that we call PALA. Just as in the case of PAL, the standard procedure for deciding PALA validity, i.e., the use of so-called reduction axioms to translate PALA formulae into formulae in epistemic logic EL, may lead to exponential growth. In this paper, we show that such price is not mandatory, for we provide a polyno...
متن کاملFrom Idempotent Generalized Boolean Assignments to Multi-bit Search
This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the notion of a generic Generalized Boolean Assignment. The mere propagation of such an assignment reveals feasibility (existence of a solution) of a formula in propositional logic. Then, we demystify this general concept by formulati...
متن کاملElliptic Approximations of Propositional Formulae
A propositional formula can be approximated by a concave quadratic function. This approximation is obtained as a second order Taylor expansion of a convex smooth model. It is shown that in the 3-SAT case, the involved parameters can be set to such values that yield optimal discriminative properties. Two concentric (generally elliptic) quadratic convex regions are established, the inner one cont...
متن کاملComplexity of validity for propositional dependence logics
Dependencies occur in many scientific disciplines. For example, in physics there are dependencies in experimental data, and in social science they can occur between voting extrapolations. For example, one might want to express whether a value of a certain physical measurement is determined by the values of some other measurements. More concretely, is it the case that in some collection of exper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 5 شماره
صفحات -
تاریخ انتشار 1998