On Minimum Representations of Matched Formulas (Extended Abstract)
نویسندگان
چکیده
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. We present here two results for matched CNFs: The first result is a shorter and simpler proof of the fact that Boolean minimization remains complete for the second level of polynomial hierarchy even if the input is restricted to matched CNFs. The second result is structural — we show that if a Boolean function f admits a representation by a matched CNF then every clause minimum CNF representation of f is matched.
منابع مشابه
A New Generalization of Extended Beta and Hypergeometric Functions
Abstract: A new generalization of extended beta function and its various properties, integral representations and distribution are given in this paper. In addition, we establish the generalization of extended hypergeometric and confluent hypergeometric functions using the newly extended beta function. Some properties of these extended and confluent hypergeometric functions such as integral repr...
متن کاملGenerating Models of a Matched Formula With a Polynomial Delay (Extended Abstract)
A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. Such a formula is always satisfiable. Matched formulas are used, for example, in the area of parameterized complexity. We prove that the problem of counting the number of the models (satisfying assignments) of a matched formula is #P-complete. On the other hand, we defin...
متن کاملOn an Extension of Extended Beta and Hypergeometric Functions
Abstract. Motivated mainly by certain interesting recent extensions of the Gamma, Beta and hypergeometric functions, we introduce here new extensions of the Beta function, hypergeometric and confluent hypergeometric functions. We systematically investigate several properties of each of these extended functions, such as their various integral representations, Mellin transforms, derivatives, tran...
متن کاملOn Minimum Representations of Matched Formulas
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. Each matched CNF is trivially satisfiable (each clause can be satisfied by its representative variable). Another property which is easy to see, is that the class of matched CNFs is not closed under partial assignment...
متن کاملExtending Utility Representations of Partial Orders
The problem is considered as to whether a monotone function defined on a subset P of Euclidean space IR can be strictly monotonically extended to IR. It is proved that this is the case if and only if the function is separably increasing. Explicit formulas are given for a class of extensions which involves an arbitrary function. Similar results are obtained for utility functions that represent s...
متن کامل