On renamable Horn and generalized Horn functions
- First Online:
- 110 Downloads
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.
KeywordsComputational logic Horn formulae generalized Horn formulae
Unable to display preview. Download preview PDF.
- 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
- 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
- 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