Recognition of q-Horn Formulae in Linear Time
نویسندگان
چکیده
The class of q-Horn Boolean expressions, generalizing the important classes of quadratic, Horn, and disguised Horn formulae, has been introduced in Boros et al. (1990). It has been shown there that the satisfiability problem corresponding to a disjunctive normal form CJ is solvable in time, linear in the size of 4, if C$ is known to be q-Horn. However, the recognition of such formulae was based on the solution of a linear programming problem, and had therefore a much higher (although still polynomial) complexity. In this paper a linear-time combinatorial algorithm is presented for recognizing q-Horn formulae, and reducing in this way the overall complexity of the corresponding satisfiability problem to a linear one.
منابع مشابه
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
In this paper we study several classes of Boolean formulae which generalize Horn formulae while preserving one of their main properties, namely the fact that satisfiability is decidable in polynomial time. We compare the known classes with respect to inclusion and define a hierarchy of new classes, which properly contains some of the known classes. © 2005 Elsevier B.V. All rights reserved.
متن کاملTheories with the Independence Property
A first-order theory T has the Independence Property provided T ⊢ (Q)(Φ ⇒ Φ1 ∨ · · · ∨ Φn) implies T ⊢ (Q)(Φ ⇒ Φi) for some i whenever Φ,Φ1, . . . ,Φn are formulae of a suitable type and (Q) is any quantifier sequence. Variants of this property have been noticed for some time in logic programming and in linear programming. We show that a first order theory has the independence property for the ...
متن کاملHorn renamability and hypergraphs
The satisfiability problem, SAT, consisting of testing the satisfiability of a propositional formula, is known to be NP-complete. On the other hand, several subclasses of propositional formulae are known, so that the restriction of SAT to such a subclass is solvable in polynomial time [7, 2] — among them Horn formulae [5] and formulae that are reducible toHorn, such as Horn-renamable formulae [...
متن کاملRecurrences and explicit formulae for the expansion and connection coefficients in series of the product of two classical discrete orthogonal polynomials
Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$ x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x),$$ we find the coefficients $b_{i,j}^{(p,q,ell ,,r)}$ in the expansion $$ x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell }y^{r}f^{(p,q)}(x,y) =sumli...
متن کاملResolution on Quantified Generalized Clause-sets
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Horn clause-sets are introduced for which a restricted resolution, called quantified positive unit resolution, is proved to be sound and refutationally complete. Moreover, it is shown that the satisfiability for quantifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 55 شماره
صفحات -
تاریخ انتشار 1994