On disguised double horn functions and extensions
- Cite this paper as:
- Eiter T., Ibaraki T., Makino K. (1998) On disguised double horn functions and extensions. In: Morvan M., Meinel C., Krob D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg
As a natural restriction of disguised Horn functions (i.e., Boolean functions which become Horn after a renaming (change of polarity) of some of the variables), we consider the class CDHR of disguised double Horn functions, i.e., the functions which and whose complement are both disguised Horn. We investigate the syntactical properties of this class and relationship to other classes of Boolean functions. Moreover, we address the extension problem of partially defined Boolean functions (pdBfs) in CDHR, where a pdBf is a function defined on a subset (rather than the full set) of Boolean vectors. We show that the class CDHR coincides with the class C1–DL of 1-decision lists, and with the intersections of several well-known classes of Boolean functions. Furthermore, polynomial time algorithms for the recognition of a function in CDHR from Horn formulas and other classes of formulas are provided, while the problem is intractable in general. We also present an algorithm for the extension problem which, properly implemented, runs in linear time.
Unable to display preview. Download preview PDF.