Log in

Relevant bibliographies by topics / Boolean expressions

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Boolean expressions'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Boolean expressions.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Boolean expressions"

1

Zaki, Mohammed J., Naren Ramakrishnan, and Lizhuang Zhao. "Mining Frequent Boolean Expressions." International Journal of Knowledge Discovery in Bioinformatics 1, no. 3 (2010): 68–96. http://dx.doi.org/10.4018/jkdb.2010070105.

Full text

Abstract:

Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. In this paper, the authors introduce a novel framework called BLOSOM for mining (frequent) boolean expressions over binary-valued datasets. Boolean expressions can be grouped into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. The authors’ main focus is on mining the simplest expressions (the minimal generators), but also to propose closure operators that yield closed (or uni

APA, Harvard, Vancouver, ISO, and other styles

2

Whang, Steven Euijong, Hector Garcia-Molina, Chad Brower, et al. "Indexing Boolean expressions." Proceedings of the VLDB Endowment 2, no. 1 (2009): 37–48. http://dx.doi.org/10.14778/1687627.1687633.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Eiter, Thomas. "Generating Boolean ?-expressions." Acta Informatica 32, no. 2 (1995): 171–87. http://dx.doi.org/10.1007/bf01177746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Eiter, Thomas. "Generating Boolean $\mu$ -expressions." Acta Informatica 32, no. 2 (1995): 171–87. http://dx.doi.org/10.1007/s002360050011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Hao, and Jitao Sun. "A New Calculation for Boolean Derivative Using Cheng Product." Journal of Applied Mathematics 2012 (2012): 1–11. http://dx.doi.org/10.1155/2012/748343.

Full text

Abstract:

The matrix expression and relationships among several definitions of Boolean derivatives are given by using the Cheng product. We introduce several definitions of Boolean derivatives. By using the Cheng product, the matrix expressions of Boolean derivative are given, respectively. Furthermore, the relationships among different definitions are presented. The logical calculation is converted into matrix product. This helps to extend the application of Boolean derivative. At last, an example is given to illustrate the main results.

APA, Harvard, Vancouver, ISO, and other styles

6

Blikle, Andrzej. "Three-Valued Predicates for Software Specification and Validation." Fundamenta Informaticae 14, no. 4 (1991): 387–410. http://dx.doi.org/10.3233/fi-1991-14402.

Full text

Abstract:

Partial functions, hence also partial predicates, cannot be avoided in algorithms. However, in spite of the fact that partial functions have been formally introduced into the theory of software very early, partial predicates are still not quite commonly recognized. In many programming- and software-specification languages partial Boolean expressions are treated in a rather simplistic way: the evaluation of a Boolean sub-expression to an error leads to the evaluation of the hosting Boolean expression to an error and, in the consequence, to the abortion of the whole program. This technique is kn

APA, Harvard, Vancouver, ISO, and other styles

7

H. AL-Jammas, Mohammed. "Adaptive Map for Simplifying Boolean Expressions." International Journal of Computer Science & Engineering Survey 4, no. 6 (2013): 1–7. http://dx.doi.org/10.5121/ijcses.2013.4601.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Buttner, Wolfram, and Helmut Simonis. "Embedding boolean expressions into logic programming." Journal of Symbolic Computation 4, no. 2 (1987): 191–205. http://dx.doi.org/10.1016/s0747-7171(87)80065-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chen, T. Y., M. F. Lau, K. Y. Sim, and C. A. Sun. "On detecting faults for Boolean expressions." Software Quality Journal 17, no. 3 (2008): 245–61. http://dx.doi.org/10.1007/s11219-008-9064-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Rossignac, Jarek. "Ordered Boolean List (OBL): Reducing the Footprint for Evaluating Boolean Expressions." IEEE Transactions on Visualization and Computer Graphics 17, no. 9 (2011): 1337–51. http://dx.doi.org/10.1109/tvcg.2010.232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Boolean expressions"

1

Tarnoff, David. "Episode 4.09 - Simplification of Boolean Expressions." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/2.

Full text

Abstract:

In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they’ll be cheaper, smaller, and faster. That’s why.

APA, Harvard, Vancouver, ISO, and other styles

2

Bittner, Sven. "General Boolean Expressions in Publish-Subscribe Systems." The University of Waikato, 2008. http://hdl.handle.net/10289/2529.

Full text

Abstract:

The increasing amount of electronically available information in society today is undeniable. Examples include the numbers of general web pages, scientific publications, and items in online auctions. From a user's perspective, this trend will lead to information overflow. Moreover, information publishers are compromised by this situation, as users have greater difficulty in identifying useful information. Publish-subscribe systems can be applied to cope with the reality of information overflow. In these systems, users specify their information interests as subscriptions and, subsequently,

APA, Harvard, Vancouver, ISO, and other styles

3

Jagadeesh, Vasudevamurthy. "On the testability-preserving decomposition and factorization of Boolean expressions." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74653.

Full text

Abstract:

This thesis presents a new concurrent method for the decomposition and factorization of Boolean expressions based on two simple objects: two-literal single-cube divisors, and double-cube divisors along with their complements. It is proved that the presence of common multiple-cube algebraic divisors, from a set of Boolean expressions, can be found by analyzing the set of double-cube divisors. It is also shown that in order to find the duality relations that may exist between various objects, only a subset of two-literal single-cube and double-cube divisors needs to be analyzed. Since the number

APA, Harvard, Vancouver, ISO, and other styles

4

Goel, Neha. "Mining Multinode Constraints and Complex Boolean Expressions for Sequential Equivalence Checking." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/76840.

Full text

Abstract:

Integrated circuit design has progressed significantly over the last few decades. This increasing complexity of hardware systems poses several challenges to the digital hardware verification. Functional verification has become the most expensive and time-consuming task in the overall product development cycle. Almost 70\% of the total verification time is being consumed by design verification and it is projected to worsen further. One of the reasons for this complexity is the synthesis and optimization (automated as well as manual) techniques used to improve performance, area, delay, and other

APA, Harvard, Vancouver, ISO, and other styles

5

Kastrati, Fisnik [Verfasser], and Guido [Akademischer Betreuer] Moerkotte. "Optimization of Boolean expressions for main memory database systems / Fisnik Kastrati ; Betreuer: Guido Moerkotte." Mannheim : Universitätsbibliothek Mannheim, 2018. http://d-nb.info/1155407881/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lindlöf, Angelica. "Deriving Genetic Networks from Gene Expression Data and Prior Knowledge." Thesis, University of Skövde, Department of Computer Science, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-589.

Full text

Abstract:

<p>In this work three different approaches for deriving genetic association networks were tested. The three approaches were Pearson correlation, an algorithm based on the Boolean network approach and prior knowledge. Pearson correlation and the algorithm based on the Boolean network approach derived associations from gene expression data. In the third approach, prior knowledge from a known genetic network of a related organism was used to derive associations for the target organism, by using homolog matching and mapping the known genetic network to the related organism. The results indicate th

APA, Harvard, Vancouver, ISO, and other styles

7

Ji, Shuping [Verfasser], Hans-Arno [Akademischer Betreuer] Jacobsen, David E. [Gutachter] Bakken, and Hans-Arno [Gutachter] Jacobsen. "Efficient Content-based Publish/Subscribe Routing and Boolean Expression Matching Algorithms / Shuping Ji ; Gutachter: David E. Bakken, Hans-Arno Jacobsen ; Betreuer: Hans-Arno Jacobsen." München : Universitätsbibliothek der TU München, 2018. http://d-nb.info/1177991349/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gastaldi, Juan Luis. "Une archéologie de la logique du sens : arithmétique et contenu dans le processus de mathématisation de la logique au XIXe siècle." Thesis, Bordeaux 3, 2014. http://www.theses.fr/2014BOR30035/document.

Full text

Abstract:

Ce travail s’engage dans la reconstitution d’une intelligibilité globale nouvelle pour la logique qui est née avec Frege afin de restituer l’une des conditions décisives pour la philosophie contemporaine, à savoir celle qui concerne son rapport aux pratiques et aux savoirs formels. Son hypothèse initiale affirme que le projet premier et constant de Frege a été celui d’une logique du contenu. Pourtant, il ne s’agit pas de réinvestir l’œuvre de Frege d’une cohérence nouvelle dans le but de rétablir une unité stable. Car l’intelligibilité procurée par cette reconstitution permet de localiser dans

APA, Harvard, Vancouver, ISO, and other styles

9

Zhan, Bo-Jun, and 詹博鈞. "The Simplification of Boolean Expressions." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/m35zr5.

Full text

Abstract:

碩士<br>逢甲大學<br>應用數學系<br>107<br>Digital system logic design is a direct application of the Boolean algebra, in which functions are the Boolean expressions. The purpose of the simplification of Boolean expressions is to minimize the number of electronic elements during the circuit implementation. Two methods used are the “direct algebraic simplification” and the so-called “Karnaugh map method”, whitch can clealy show apart of the Boolean expression that needs to be simplified. This thesis explains the relationship between the two methods of Boolean expression simplification, explores the origin a

APA, Harvard, Vancouver, ISO, and other styles

10

Ya-Wen, Chang Chien, and 張簡雅文. "A Study of Association Rules Based on Matrices and Boolean Expressions." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/23475276537697067721.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>資訊管理系<br>91<br>Algorithms of association rules in techniques of data mining are used to find associations of products. Proposed association algorithms in the present studies contain weaknesses such as generating a lot of candidate itemsets, and repeated scanning over the database. In this paper, we present two new algorithms named Matrix_AND Based Association Rule (MABAR) and Matrix_Equivlence Based Association Rule (MEBAR) for efficient association rule mining to overcome these described drawbacks. MABAR is designed based on Matrix and AND Boolean expressions, and MEBAR is

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Boolean expressions"

1

Carlsen, Victoria C. Boolean Logic, Expressions and Theories: An Overview. Nova Science Publishers, Incorporated, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Carlsen, Victoria C. Boolean Logic, Expressions and Theories: An Overview. Nova Science Publishers, Incorporated, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Introduction to Digital Logic and Boolean Algebra: A Comprehensive Guide to Binary Operations, Logic Gates, Logical Expression Analysis and Number Representations in Digital Technology. Independently Published, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Boolean expressions"

1

Gries, David, and Fred B. Schneider. "Boolean Expressions." In A Logical Approach to Discrete Math. Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-3837-7_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Minato, Shin-ichi. "Arithmetic Boolean Expressions." In The Kluwer International Series in Engineering and Computer Science. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1303-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Back, Ralph-Johan, and Joakim Wright. "Boolean Expressions and Conditionals." In Refinement Calculus. Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1674-2_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ferraz, Evandro C., Jeferson de Lima Muniz, Alexandre C. R. da Silva, and Gerhard W. Dueck. "Synthesis of Majority Expressions Through Primitive Function Manipulation." In Advanced Boolean Techniques. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20323-8_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jenkyns, Tom, and Ben Stephenson. "Boolean Expressions, Logic, and Proof." In Undergraduate Topics in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70151-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Jenkyns, Tom, and Ben Stephenson. "Boolean Expressions, Logic, and Proof." In Undergraduate Topics in Computer Science. Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4069-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bijlsma, A. "Semantics of Quasi-Boolean Expressions." In Beauty Is Our Business. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-4476-9_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Peh, Lawrence, and C. P. Tsang. "Weight sensitive Boolean extraction produces compact expressions." In Advanced Topics in Artificial Intelligence. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63797-4_95.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Krell, Fernando, Gabriela Ciocarlie, Ashish Gehani, and Mariana Raykova. "Low-Leakage Secure Search for Boolean Expressions." In Topics in Cryptology – CT-RSA 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52153-4_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Adhikari, Animesh, and Jhimli Adhikari. "Synthesizing Arbitrary Boolean Expressions Induced by Frequent Itemsets." In Advances in Knowledge Discovery in Databases. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13212-9_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Boolean expressions"

1

Brida, Simon Gutierrez, and Gaston Scilingo. "Boolean expression extender — A mutation operator for strengthening and weakening boolean expressions." In 2017 XLIII Latin American Computer Conference (CLEI). IEEE, 2017. http://dx.doi.org/10.1109/clei.2017.8226471.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fontoura, Marcus, Suhas Sadanandan, Jayavel Shanmugasundaram, et al. "Efficiently evaluating complex boolean expressions." In the 2010 international conference. ACM Press, 2010. http://dx.doi.org/10.1145/1807167.1807171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kastrati, Fisnik, and Guido Moerkotte. "Generating Optimal Plans for Boolean Expressions." In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 2018. http://dx.doi.org/10.1109/icde.2018.00095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Ziyuan, Zhenyu Chen, Tsong-Yueh Chen, and Baowen Xu. "Fault class prioritization in Boolean expressions." In the 27th Annual ACM Symposium. ACM Press, 2012. http://dx.doi.org/10.1145/2245276.2231963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Zhenyu, Zhongxing Xu, Zhifang Liu, and Xiaopeng Gao. "Macro-Like Instrumentation Grammar for Boolean Expressions." In 2010 International Conference on Computational Intelligence and Software Engineering (CiSE). IEEE, 2010. http://dx.doi.org/10.1109/cise.2010.5676786.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Nanda, Mangala Gowri, and S. Arun-Kumar. "Decompiling Boolean Expressions from Java™ Bytecode." In ISEC '16: 9th India Software Engineering Conference. ACM, 2016. http://dx.doi.org/10.1145/2856636.2856651.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sato, Tatsuo, Joung-Hoon Lim, Ken-ichi Okada, and Yutaka Matsushita. "A multimedia synchronization model described by Boolean expressions." In the 1993 ACM conference. ACM Press, 1993. http://dx.doi.org/10.1145/170791.170845.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Goel, Neha, Michael S. Hsiao, Narendran Ramakrishnan, and Mohammed J. Zaki. "Mining Complex Boolean Expressions for Sequential Equivalence Checking." In 2010 19th Asian Test Symposium (ATS). IEEE, 2010. http://dx.doi.org/10.1109/ats.2010.81.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Fraser, Gordon, and Angelo Gargantini. "Generating Minimal Fault Detecting Test Suites for Boolean Expressions." In 2010 IEEE International Conference on Software Testing Verification and Validation Workshop (ICSTW). IEEE, 2010. http://dx.doi.org/10.1109/icstw.2010.51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lau, M. F., Y. Liu, and Y. T. Yu. "Detecting Double Faults on Term and Literal in Boolean Expressions." In Seventh International Conference on Quality Software (QSIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/qsic.2007.4385487.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!