On renamable Horn and generalized Horn functions
 Vijaya Chandru,
 Collette R. Coullard,
 Peter L. Hammer,
 Miguel Montañez,
 Xiaorong Sun
 … show all 5 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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 lineartime 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 2SAT. Some computational results are also given.
 Arvind, V., Biswas, S. (1987) 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: pp. 6669
 Aspvall, B. (1980) Recognizing disguised NR(1) instance of the satisfiability problem. J. Algorithms 1: pp. 97103 CrossRef
 Aspvall, B., Plass, M.F., Tarjan, R.E. (1979) A lineartime algorithm for testing the truth of certain quantified Boolean formula. Infor. Proc. Lett. 8: pp. 121123 CrossRef
 Blair, C.E., Jeroslow, R.G., Lowe, J.K. (1986) Some results and experiments in programming techniques for prepositional logic. Comp. Oper. Res. 13: pp. 633645 CrossRef
 Bondy, J.A., Murty, U.S.R. (1976) Graph Theory with Applications. NorthHolland, New York
 Chang, C., Lee, R. (1973) Symbolic Logic and Mechanical TheoremProving. Academic Press, New York
 Cook, S.A. (1971) The complexity of theorem proving procedures. ACM, New York
 Dobkin, D., Lipton, R.J., Reiss, S. (1979) Linear programming is logspace hard forP. Infor. Proc. Lett. 8: pp. 9697 CrossRef
 Dowling, W.F., Gallier, J.H. (1984) Lineartime algorithms for testing the satisfiability of prepositional Horn formulae. J. Logic Programming 1: pp. 267284 CrossRef
 Edmonds, J. (1965) Paths, trees, and flowers. Can. J. Math. 17: pp. 449467 CrossRef
 Fariñas del Cerro, L., Penttonen, M. (1987) A note on the complexity of the satisfiability of modal Horn clauses. J. Logic Programming 4: pp. 110 CrossRef
 Gallier, J.H., Raatz, S.T. (1987) HORNLOG: A graphbased interpreter for general Horn clauses. J. Logic Programming 4: pp. 119115 CrossRef
 Henschen, L., Wos, L. (1974) Unit refutations and Horn sets. J. ACM 21: pp. 590605 CrossRef
 Lindhorst, G., Shahrokhi, F. (1989) On renaming a set of clauses as a Horn set. Infor. Proc. Lett. 30: pp. 289293 CrossRef
 Lewis, H.R. (1978) Renaming a set of clauses as a Horn set. J. ACM 25: pp. 134135 CrossRef
 F.M. Liang, Comprehensive examinations in computer science 1972–1978, Technical Report STANCS78677, Department of Computer Science, Stanford University (1978) pp. 93–94.
 Mannila, H., Mehlhorn, K. (1985) A fast algorithm for renaming a set of clauses as a Horn set. Infor. Proc. Lett. 21: pp. 269272 CrossRef
 Tarjan, R.E. (1972) Depth first search and linear graph algorithms. SIAM J. Comput. 1: pp. 146160 CrossRef
 Tseitin, G.S. On the complexity of derivation in the prepositional calculus. In: Slisenko, A.O. eds. (1968) Structures in Constructive Mathematics and Mathematical Logic. Consultants Bureau, New York, pp. 115125
 Yamasaki, S., Doshita, S. (1983) The satisfiability problem for the class consisting of Horn sentences and some nonHorn sentences in propositional logic. Infor. Control 59: pp. 112 CrossRef
 Title
 On renamable Horn and generalized Horn functions
 Journal

Annals of Mathematics and Artificial Intelligence
Volume 1, Issue 14 , pp 3347
 Cover Date
 19900901
 DOI
 10.1007/BF01531069
 Print ISSN
 10122443
 Online ISSN
 15737470
 Publisher
 Springer Netherlands
 Additional Links
 Topics
 Keywords

 Computational logic
 Horn formulae
 generalized Horn formulae
 Industry Sectors
 Authors

 Vijaya Chandru ^{(1)}
 Collette R. Coullard ^{(1)}
 Peter L. Hammer ^{(2)}
 Miguel Montañez ^{(1)}
 Xiaorong Sun ^{(2)}
 Author Affiliations

 1. School of Industrial Engineering, Purdue University, 47907, West Lafayette, IN, USA
 2. RUTCORRutgers Center for Operations Research, Rutgers University, 08903, New Brunswick, NJ, USA