On renamable Horn and generalized Horn functions

  • Vijaya Chandru
  • Collette R. Coullard
  • Peter L. Hammer
  • Miguel Montañez
  • Xiaorong Sun


A Boolean function in disjunctive normal form (DNF) is aHorn function if each of its elementary conjunctions involves at most one complemented variable. Ageneralized Horn function is constructed from a Horn function by disjuncting a nested set of complemented variables to it. The satisfiability problem is solvable in polynomial time for both Horn and generalized Horn functions. A Boolean function in DNF is said to berenamable Horn if it is Horn after complementation of some variables. Succinct mathematical characterizations and linear-time algorithms for recognizing renamable Horn and generalized Horn functions are given in this paper. The algorithm for recognizing renamable Horn functions gives a new method to test 2-SAT. Some computational results are also given.


Computational logic Horn formulae generalized Horn formulae 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    V. Arvind and S. Biswas, AnO(n 2) algorithm for the satisfiability problem of a subset of prepositional sentences in CNF that includes all Horn sentences, Infor. Proc. Lett. 24 (1) (1987) 66–69.MathSciNetGoogle Scholar
  2. [2]
    B. Aspvall, Recognizing disguised NR(1) instance of the satisfiability problem, J. Algorithms 1 (1980) 97–103.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    B. Aspvall, M.F. Plass and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formula, Infor. Proc. Lett. 8 (1979) 121–123.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    C.E. Blair, R.G. Jeroslow and J.K. Lowe, Some results and experiments in programming techniques for prepositional logic, Comp. Oper. Res. 13 (1986) 633–645.MathSciNetCrossRefMATHGoogle Scholar
  5. [5]
    J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (North-Holland, New York, 1976).MATHGoogle Scholar
  6. [6]
    C. Chang and R. Lee,Symbolic Logic and Mechanical Theorem-Proving (Academic Press, New York, 1973).MATHGoogle Scholar
  7. [7]
    S.A. Cook, The complexity of theorem proving procedures,Proc. 3rd Annual ACM Symp. on Theory of Computing, ACM, New York (1971) pp. 151–158.Google Scholar
  8. [8]
    D. Dobkin, R.J. Lipton and S. Reiss, Linear programming is log-space hard forP, Infor. Proc. Lett. 8 (1979) 96–97.MathSciNetCrossRefMATHGoogle Scholar
  9. [9]
    W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of prepositional Horn formulae, J. Logic Programming 1 (1984) 267–284.MathSciNetCrossRefMATHGoogle Scholar
  10. [10]
    J. Edmonds, Paths, trees, and flowers, Can. J. Math. 17 (1965) 449–467.MathSciNetCrossRefMATHGoogle Scholar
  11. [11]
    L. Fariñas del Cerro and M. Penttonen, A note on the complexity of the satisfiability of modal Horn clauses, J. Logic Programming 4 (1987) 1–10.MathSciNetCrossRefMATHGoogle Scholar
  12. [12]
    J.H. Gallier and S.T. Raatz, HORNLOG: A graph-based interpreter for general Horn clauses, J. Logic Programming 4 (1987) 119–115.MathSciNetCrossRefMATHGoogle Scholar
  13. [13]
    L. Henschen and L. Wos, Unit refutations and Horn sets, J. ACM 21 (1974) 590–605.MathSciNetCrossRefMATHGoogle Scholar
  14. [14]
    G. Lindhorst and F. Shahrokhi, On renaming a set of clauses as a Horn set, Infor. Proc. Lett. 30 (1989) 289–293.MathSciNetCrossRefMATHGoogle Scholar
  15. [15]
    H.R. Lewis, Renaming a set of clauses as a Horn set, J. ACM 25 (1978) 134–135.CrossRefMATHGoogle Scholar
  16. [16]
    F.M. Liang, Comprehensive examinations in computer science 1972–1978, Technical Report STAN-CS-78-677, Department of Computer Science, Stanford University (1978) pp. 93–94.Google Scholar
  17. [17]
    H. Mannila and K. Mehlhorn, A fast algorithm for renaming a set of clauses as a Horn set, Infor. Proc. Lett. 21 (1985) 269–272.CrossRefGoogle Scholar
  18. [18]
    R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146–160.MathSciNetCrossRefMATHGoogle Scholar
  19. [19]
    G.S. Tseitin, On the complexity of derivation in the prepositional calculus,Structures in Constructive Mathematics and Mathematical Logic, part 2 (translated from Russian) ed. A.O. Slisenko (Consultants Bureau, New York, 1968) pp. 115–125.Google Scholar
  20. [20]
    S. Yamasaki and S. Doshita, The satisfiability problem for the class consisting of Horn sentences and some non-Horn sentences in propositional logic, Infor. Control 59 (1983) 1–12.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1990

Authors and Affiliations

  • Vijaya Chandru
    • 1
  • Collette R. Coullard
    • 1
  • Peter L. Hammer
    • 2
  • Miguel Montañez
    • 1
  • Xiaorong Sun
    • 2
  1. 1.School of Industrial EngineeringPurdue UniversityWest LafayetteUSA
  2. 2.RUTCOR-Rutgers Center for Operations ResearchRutgers UniversityNew BrunswickUSA

Personalised recommendations