Abstract
Every k-interval Boolean function f can be represented by at most k intervals of integers such that vector x is a truepoint of f if and only if the integer represented by x belongs to one of these k (disjoint) intervals. Since the correspondence of Boolean vectors and integers depends on the order of bits an interval representation is also specified with respect to an order of variables of the represented function. Interval representation can be useful as an efficient representation for special classes of Boolean functions which can be represented by a small number of intervals. In this paper we study inclusion relations between the classes of threshold and k-interval Boolean functions. We show that positive 2-interval functions constitute a (proper) subclass of positive threshold functions and that such inclusion does not hold for any k>2. We also prove that threshold functions do not constitute a subclass of k-interval functions, for any k.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anthony, M. (2001). Discrete mathematics of neural networks: selected topics. Philadelphia: Society for Industrial and Applied Mathematics.
Bilbao, J. M., Chacón, C., Jiménez-Losada, A., & Lebrón, E. (2000). Dual games on combinatorial structures. Dordrecht: Kluwer Academic. citeseer.ist.psu.edu/443978.html.
Boros, E., Čepek, O., & Kogan, A. (1998). Horn minimization by iterative decomposition. Annals of Mathematics and Artificial Intelligence, 23, 321–343.
Čepek, O., & Kronus, D. (2007). Recognition of positive 2-interval boolean function. In Proceedings of the 16th annual conference of doctoral students—WDS 2007 (Vol. 1, pp. 7–12).
Čepek, O., Kronus, D., & Kučera, P. (2008). Recognition of interval boolean functions. Annals of Mathematics and Artificial Intelligence, 52(1), 1–24.
Genesereth, M. R., & Nilsson, N. J. (1987). Logical foundations of artificial intelligence. Los Altos: Morgan Kaufmann.
Hammer, P. L., & Kogan, A. (1993). Optimal compression of propositional horn knowledge bases: complexity and approximation. Artificial Intelligence, 64, 131–145.
Hammer, P. L., & Rudeanu, S. (1968). Boolean methods in operations research and related areas. Berlin: Springer.
Hu, S. T. (1965). Threshold logic. Berkeley: University of California Press.
Kronus, D. (2006). Interval representations of threshold and 2-monotonic boolean functions. In: Proceedings of the 15th annual conference of doctoral students—WDS 2006 (Vol. 1, pp. 167–171).
Mendelson, E. (1970). Boolean algebra and switching circuits. New York: McGraw-Hill Book.
Muroga, S. (1971). Threshold logic and its applications. New York: Wiley.
Owen, G. (1995). Game theory. San Diego: Academic Press.
Schieber, B., Geist, D., & Zaks, A. (2005). Computing the minimum DNF representation of boolean functions defined by intervals. Discrete Applied Mathematics, 149, 154–173.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research was supported by Czech Science Foundation (GACR) under contract no. 201/05/H014.
Rights and permissions
About this article
Cite this article
Kronus, D. Relations between threshold and k-interval Boolean functions. Ann Oper Res 188, 263–278 (2011). https://doi.org/10.1007/s10479-010-0786-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0786-y