Recognition and dualization of disguised bidual Horn functions

We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time in general (unless SAT is solvable in quasi-polynomial time), it is so in case the input belongs to special classes, e.g., the class of bidual Horn CNF [9] (i.e., both and its dual d represent Horn functions). In this paper, we show that a disguised bidual Horn CNF (i.e., becomes a bidual Horn CNF after renaming of variables) can be recognized in polynomial time, and its dualization can be done in quasi-polynomial total time. We also establish a similar result for dualization of prime CNFs.

• Type: Journal
• Year: 2002
• Where: IPL
• Authors: Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
• Keywords: Bidual Horn Cnf, Boolean Function, IPL 2002, Quasi-polynomial Total Time