Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Set Theory (F.4.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 12 Reviews about "Set Theory (F.4.1...)": Date Reviewed   Reconsidering pairs and functions as sets Brown C. Journal of Automated Reasoning 55(3): 199-210, 2015.  Type: Article In set theory, a pair (x,y) is normally described using Kuratowski’s representation {{x},{x,y}}. The set of all the pairs ( Dec 8 2015   On (k, n)*-visual cryptography scheme Arumugam S., Lakshmanan R., Nagar A. Designs, Codes and Cryptography 71(1): 153-162, 2014.  Type: Article Imagine you have several transparencies and they all have black and white regions or pixels. Each one of them may not show anything in particular, but stacked up, an image may be revealed. This is the gist of a visual cryptography sche... Jun 5 2014   Rough sets and intelligent systems--Professor Zdzislaw Pawlak in memoriam (Vol. 1) Skowron A., Suraj Z., Springer Publishing Company, Incorporated, New York, NY, 2013. 704 pp.  Type: Book (978-3-642303-43-2) This is the first volume of a two-volume set of papers dedicated to the memory of Zdzislaw Pawlak. The second volume was previously reviewed in Computing Reviews [1]. There are 24 papers in this volume, three of which emphasize ... Aug 6 2013   Rough sets and intelligent systems - Professor Zdzisław Pawlak in memoriam (Vol. 2) Skowron A., Suraj Z., Springer Publishing Company, Incorporated, New York, NY, 2012. 656 pp.  Type: Book (978-3-642303-40-1) Logical analysis requires precision in the definition and understanding of concepts and in the classification of data. However, many problems have inherently imprecise and vague components. For example, the fundamental concept of a set... Jan 14 2013   Transactions on rough sets IX Peters J., Skowron A., Rybiński H. Springer-Verlag, New York, NY, 2008.  Type: Divisible Book Pawlak originally developed rough sets to be used in the same situations as Zadeh’s better-known fuzzy sets [1]. Although they are less popular than fuzzy sets, they do have a devoted following and are proven to be a good too... Dec 16 2009   Mathematical tools for data mining: set theory, partial orders, combinatorics Simovici D., Djeraba C., Springer Publishing Company, Incorporated, 2008. 628 pp.  Type: Book (9781848002005) The dependence of data mining on mathematics, particularly on set theory, statistics, and linear algebra, is unquestionable. There are numerous examples that underline this reliance. For example, the task of frequent itemset mining is ... Feb 6 2009   To afford or not to afford: a new formalization of affordances toward affordance-based robot control Şahin E., Çakmak M., Doğar M., Uğur E., Üçoluk G. Adaptive Behavior 15(4): 447-472, 2007.  Type: Article One might wonder what Şahin et al. are trying to afford, but this is not a paper on robotic affordances. Instead, the authors try to reason whether to enter a heated debate--many dilemmas and criticisms might arise fr... Feb 29 2008   Combining sets with cardinals Zarba C. Journal of Automated Reasoning 34(1): 1-29, 2005.  Type: Article The introduction to this excellent, instructive, highly theoretical paper is also a clear statement of its general motivation: to enable (decidable) reasoning about “logical formulas involving sets of elements of a given natu... Jun 16 2006   On the existence of large sets of t-designs of prime sizes Tayfeh-Rezaie B. Designs, Codes and Cryptography 37(1): 143-149, 2005.  Type: Article This is a theoretical note on a result in set theory. The focus of the discussion is on “large sets of t-designs.” Utilizing existing theorems, the author proves new theorems on the existence of la... Jun 8 2006   Predicate abstraction of ANSI-C programs using SAT Clarke E., Kroening D., Sharygina N., Yorav K. Formal Methods in System Design 25(2-3): 105-127, 2004.  Type: Article Predicate abstraction is a method used for checking software systems. One looks for a model with a reduced state space; the original data variables are eliminated, and each predicate is represented by a Boolean variable that represents... Apr 7 2005       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy