Abstract
A method is presented for computing the number of elements in any collection of sets derived from other sets by statements that are reducible to conjunctions, disjunctions, and complementations. The technique also detects certain inconsistencies that may be present in the given data. The method is applicable to a wide range of problems in computer science, actuarial studies, survey statistics, and the social and systems sciences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Hellerman and T. C. Conroy,Computer System Performance (McGraw-Hill Book Co., New York, 1975), pp. 107–108.
E. D. Homer, “On the computation of the number of elements in combinations of sets,”Am. Math. Mon. 74:531–522 (1967).
R. S. Ledley,Digital Computer and Control Engineering (McGraw-Hill, New York, 1960).
C. L. Liu,Introduction to Combinatorial Mathematics (McGraw-Hill, New York, 1968).
H. J. Ryser,Combinatorial Mathematics (John Wiley & Sons, New York, 1963).
H. J. Ryser, “Subsets of a finite set that intersect each other in at most one element,”J. Comb. Theor. 17:59–74 (1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hellerman, H., Cavallo, R. On the solution of multiattribute problems involving counting in intersecting sets. International Journal of Computer and Information Sciences 6, 1–7 (1977). https://doi.org/10.1007/BF00991479
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991479