Abstract
In this paper we show the equivalence between the problem of determining self-duality of a boolean function in DNF and a special type of satisfiability problem called NAESPI. Eiter and Gottlob [8] use a result from [2] to show that self-duality of monotone boolean functions which have bounded clause sizes (by some constant) can be determined in polynomial time. We show that the self-duality of instances in the class studied by Eiter and Gottlob can be determined in time linear in the number of clauses in the input, thereby strengthening their result. Domingo [7] recently showed that self-duality of boolean functions where each clause is bounded by \( \left( {\sqrt {\log n} } \right) \) can be solved in polynomial time. Our linear time algorithm for solving the clauses with bounded size infact solves the \( \left( {\sqrt {\log n} } \right) \) bounded self-duality problem in \( O\left( {n^2 \sqrt {\log n} } \right) \) time, which is better bound then the algorithm of Domingo [7], O(n3). Another class of self-dual functions arising naturally in application domain has the property that every pair of terms in f intersect in at most constant number of variables. The equivalent subclass of NAESPI is the c-bounded NAESPI. We also show that c-bounded NAESPI can be solved in polynomial time when c is some constant. We also give an alternative characterization of almost self-dual functions proposed by Bioch and Ibaraki [5] in terms of NAESPI instances which admit solutions of a ‘particular’ type.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Barbara and H. Garcia-Molina. The vulnerability of vote assignments. ACM Transactions on Computer Systems, 4(3):187–213, Aug. 1986. 209
C. Berge. Graphs and Hypergraphs. North-Holland, 1973. 209, 210
J. Bioch and T. Ibaraki. Complexity of identification and dualization of positive boolean functions. Information and Computation, 123(1):50–63, 1995. 209
J. Bioch and T. Ibaraki. Decomposition of positive self-dual functions. Discrete Mathematics, 140:23–46, 1995. 209
J. C. Bioch and T. Ibaraki. Generating and approximating nondominated coteries. IEEE Transactions on parallel and distributed systems, 6(9):905–913, 1995. 209, 210, 213
E. Boros, P.L. Hammer, T. Ibaraki, and K. Kawakami. Identifying 2-monotonic positive boolean functions in polynomial time. In W.L. Hsu and R.C.T. Lee, editors, Springer Lecture Notes in Computer Science557, International Symposium on Algorithms, Taipei, 104–115, 1991. 210
D. Carlos. Polynomial time algorithms for some self-duality problems. In Proceedings of the Italian Conference on Algorithms, March 1997. 209, 222
T. Eiter and G. Gottlob. Identifying the minimum transversals of a hypergraph and related problems. Siam Journal of Computing, 24(6):1278–1304, 1995. 209, 210, 222
Michael L. Fredman and Leonid Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21(3):618–628, Nov. 1996. 209, 211
H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of the ACM, 32:841–860, 1985. 209
V. Gurvich and L. Khachiyan. Generating the irredundant conjunctive and disjunctive normal forms of monotone boolean functions. Technical Report LCSR-TR-251, Dept. of Computer Science, Rutgers Univ., Aug. 1995. 209
T. Ibaraki and T. Kameda. A boolean theory of coteries. IEEE Transactions on Parallel and Distributed Systems, pages 779–794, 1993. 210
K. Makino and T. Ibaraki. The maximum latency and identification of positive boolean functions. In D. Z. Du and X. S. Zhang, editors, ISAAC 1994, Algorithms and Computation, volume 834 of Springer Lecture Notes in Computer Science, pages 324–332. 210
H. Mannila and K. J. Räihä. An application of armstrong relations. Journal of Computer and System Science, 22:126–141, 1986. 209
C. Papadimitriou. Computational Complexity. Addison Wesley, 1994. 210
R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57 95, 1987. 209
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ram Gaur, D., Krishnamurti, R. (2000). Self-duality of Bounded Monotone Boolean Functions and Related Problems. In: Arimura, H., Jain, S., Sharma, A. (eds) Algorithmic Learning Theory. ALT 2000. Lecture Notes in Computer Science(), vol 1968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40992-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-40992-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41237-3
Online ISBN: 978-3-540-40992-2
eBook Packages: Springer Book Archive