Relevant bibliographies by topics / Common Boolean Logic

Contents

  1. Journal articles
  2. Books
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Common Boolean Logic'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

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 'Common Boolean Logic.'

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 "Common Boolean Logic"

1

Chajda, Ivan. "Basic algebras, logics, trends and applications." Asian-European Journal of Mathematics 08, no. 03 (2015): 1550040. http://dx.doi.org/10.1142/s1793557115500400.

Full text
Abstract:
The classical logic was axiomatized algebraically by means of Boolean algebras in 19th century by George Boole. Similar attempts went on 20th century for algebraic axiomatization of non-classical logics, e.g. intuitionistic logics (Brouwer and Heyting algebras), many-valued logics (Łukasiewicz, Chang’s MV-algebras, Post algebras), the logic of quantum mechanics (orthomodular lattices and posets) and fuzzy logics (residuated lattices). In this paper, we are focused in a common generalization of MV-algebras and orthomodular lattices. The resulting algebras, called basic algebras, have surprising
APA, Harvard, Vancouver, ISO, and other styles
2

Nandam, Krishna Sravani, K. Jamal, Anil Kumar Budati, Kiran Mannem, and Manchalla O. V. P. Kumar. "Design and analysis of Dadda multiplier with Common Boolean Logic." Materials Today: Proceedings 33 (2020): 4833–36. http://dx.doi.org/10.1016/j.matpr.2020.08.392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jain, Nikita, Jitendra Jain, and Krishna Kant. "Area Efficient High Speed Vedic Multiplier using Common Boolean Logic." International Journal of Computer Applications 132, no. 2 (2015): 46–48. http://dx.doi.org/10.5120/ijca2015907308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wright, Adam, Skye Aaron, Allison B. McCoy, et al. "Algorithmic Detection of Boolean Logic Errors in Clinical Decision Support Statements." Applied Clinical Informatics 12, no. 01 (2021): 182–89. http://dx.doi.org/10.1055/s-0041-1722918.

Full text
Abstract:
Abstract Objective Clinical decision support (CDS) can contribute to quality and safety. Prior work has shown that errors in CDS systems are common and can lead to unintended consequences. Many CDS systems use Boolean logic, which can be difficult for CDS analysts to specify accurately. We set out to determine the prevalence of certain types of Boolean logic errors in CDS statements. Methods Nine health care organizations extracted Boolean logic statements from their Epic electronic health record (EHR). We developed an open-source software tool, which implemented the Espresso logic minimizatio
APA, Harvard, Vancouver, ISO, and other styles
5

Priya, Meshram, Mahendra Mithilesh, and Jawarkar Parag. "Designed Implementation of Modified Area Efficient Enhanced Square Root Carry Select Adder." International Journal for Research in Emerging Science and Technology 2, no. 5 (2015): 96–99. https://doi.org/10.5281/zenodo.33092.

Full text
Abstract:
In the design of Integrated Circuits, area occupancy plays a vital role because of increasing the necessity of portable systems. Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. In this paper, an area-efficient carry select adder by sharing the common Boolean logic term (CBL) with BEC is proposed. After logic simplification and sharing partial circuit, only one XOR gate and one inverter gate in each summation operation as well as one AND gate and one inverter gate in each carry-out operation are needed. Based o
APA, Harvard, Vancouver, ISO, and other styles
6

Chajda, Ivan, and Helmut Länger. "Basic semirings." Mathematica Slovaca 69, no. 3 (2019): 533–40. http://dx.doi.org/10.1515/ms-2017-0245.

Full text
Abstract:
Abstract Basic algebras were introduced by Chajda, Halaš and Kühr as a common generalization of MV-algebras and orthomodular lattices, i.e. algebras used for formalization of non-classical logics, in particular the logic of quantum mechanics. These algebras were represented by means of lattices with section involutions. On the other hand, classical logic was formalized by means of Boolean algebras which can be converted into Boolean rings. A natural question arises if a similar representation exists also for basic algebras. Several attempts were already realized by the authors, see the referen
APA, Harvard, Vancouver, ISO, and other styles
7

De Nijs, Roderick Sebastiaan, Christian Landsiedel, Dirk Wollherr, and Martin Buss. "Quadratization and Roof Duality of Markov Logic Networks." Journal of Artificial Intelligence Research 55 (March 25, 2016): 685–714. http://dx.doi.org/10.1613/jair.5023.

Full text
Abstract:
This article discusses the quadratization of Markov Logic Networks, which enables efficient approximate MAP computation by means of maximum flows. The procedure relies on a pseudo-Boolean representation of the model, and allows handling models of any order. The employed pseudo-Boolean representation can be used to identify problems that are guaranteed to be solvable in low polynomial-time. Results on common benchmark problems show that the proposed approach finds optimal assignments for most variables in excellent computational time and approximate solutions that match the quality of ILP-based
APA, Harvard, Vancouver, ISO, and other styles
8

Kowalski, Tomasz, Francesco Paoli, and Matthew Spinks. "Quasi-subtractive varieties." Journal of Symbolic Logic 76, no. 4 (2011): 1261–86. http://dx.doi.org/10.2178/jsl/1318338848.

Full text
Abstract:
AbstractVarieties like groups, rings, or Boolean algebras have the property that, in any of their members, the lattice of congruences is isomorphic to a lattice of more manageable objects, for example normal subgroups of groups, two-sided ideals of rings, filters (or ideals) of Boolean algebras. Abstract algebraic logic can explain these phenomena at a rather satisfactory level of generality: in every member A of a τ-regular variety the lattice of congruences of A is isomorphic to the lattice of deductive filters on A of the τ-assertional logic of . Moreover, if has a constant 1 in its type an
APA, Harvard, Vancouver, ISO, and other styles
9

M, Syed Mustafaa, Sathish M, Nivedha S, Magribatul Noora A K, and Safrin Sifana T. "Design of Carry Select Adder using BEC and Common Boolean Logic." Indian Journal of VLSI Design 1, no. 3 (2022): 5–9. http://dx.doi.org/10.54105/ijvlsid.c1205.031322.

Full text
Abstract:
Carry Select Adder (CSLA) is known to be the fastest adder among the conventional adder structure, which uses multiple narrow adders. CSLA has a great scope of reducing area, power consumption, speed and delay. From the structure of regular CSLA using RCA, it consumes large area and power. This proposed work uses a simple and dynamic Gate Level Implementation which reduces the area, delay, power and speed of the regular CSLA. Based on a modified CSLA using BEC the implementation of 8-b, 16-b, 32-b square root CSLA (SQRT CSLA) architecture have been developed. In order to reduce the area and po
APA, Harvard, Vancouver, ISO, and other styles
10

Syed, Mustafaa M., M. Sathish, S. Nivedha, Magribatul Noora A. K. Mohammed, and Sifana T. Safrin. "Design of Carry Select Adder using BEC and Common Boolean Logic." Indian Journal of VLSI Design (IJVLSID) 1, no. 3 (2022): 5–9. https://doi.org/10.54105/ijvlsid.C1205.031322.

Full text
Abstract:
Carry Select Adder (CSLA) is known to be the fastest adder among the conventional adder structure, which uses multiple narrow adders. CSLA has a great scope of reducing area, power consumption, speed and delay. From the structure of regular CSLA using RCA, it consumes large area and power. This proposed work uses a simple and dynamic Gate Level Implementation which reduces the area, delay, power and speed of the regular CSLA. Based on a modified CSLA using BEC the implementation of 8-b, 16-b, 32-b square root CSLA (SQRT CSLA) architecture have been developed. In order to reduce the area and po
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Common Boolean Logic"

1

Dooley, Brendan, ed. The Continued Exercise of Reason. The MIT Press, 2018. http://dx.doi.org/10.7551/mitpress/9780262535007.001.0001.

Full text
Abstract:
George Boole (1815–1864), remembered by history as the developer of an eponymous form of algebraic logic, can be considered a pioneer of the information age not only because of the application of Boolean logic to the design of switching circuits but also because of his contributions to the mass distribution of knowledge. In the classroom and the lecture hall, Boole interpreted recent discoveries and debates in a wide range of fields for a general audience. This collection of lectures, many never before published, offers insights into the early thinking of an innovative mathematician and intell
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Common Boolean Logic"

1

Dacík, Tomáš, Adam Rogalewicz, Tomáš Vojnar, and Florian Zuleger. "Deciding Boolean Separation Logic via Small Models." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_11.

Full text
Abstract:
AbstractWe present a novel decision procedure for a fragment of separation logic (SL) with arbitrary nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded negations together with a support for the most common variants of linked lists. Our method is based on a model-based translation to SMT for which we introduce several optimisations—the most important of them is based on bounding the size of predicate instantiations within models of larger formulae, which leads to a much more efficient translation of SL formulae to SMT. Through a series of experiments, we sho
APA, Harvard, Vancouver, ISO, and other styles
2

Jujjuru, Jaya Lakshmi, and Rajanbabu Mallavarapu. "Improved SQRT Architecture for Carry Select Adder Using Modified Common Boolean Logic." In Proceedings of 2nd International Conference on Micro-Electronics, Electromagnetics and Telecommunications. Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-4280-5_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Akshay, S., Eliyahu Basa, Supratik Chakraborty, and Dror Fried. "On Dependent Variables in Reactive Synthesis." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_8.

Full text
Abstract:
AbstractGiven a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs at every time step for every sequence of inputs, such that the LTL formula is satisfied. In this paper, we investigate the notion of dependent variables in the context of reactive synthesis. Inspired by successful pre-processing techniques in Boolean functional synthesis, we define dependent variables in reactive synthesis as output variables that are uniquely assigned, given an assignment to all other varia
APA, Harvard, Vancouver, ISO, and other styles
4

Nguyen Hien D. and Do Nhon V. "Intelligent Problem Solver in Education for Discrete Mathematics." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2017. https://doi.org/10.3233/978-1-61499-800-6-21.

Full text
Abstract:
A grand challenge for artificial intelligence in education is building the Intelligent Problem Solver (IPS) for Science Technology Engineering and Math (STEM) Education. The IPS system has to be able to solve the exercises of the course automatically. It has the following criteria: the knowledge base is sufficient, the program can solve the common exercises in the curriculum of the course based on the knowledge base, the solutions are readable, pedagogical and suitable for the learner's level. Discrete Mathematics is an important course for the undergrad technological curriculum at the univers
APA, Harvard, Vancouver, ISO, and other styles
5

Flarend, Alice, and Bob Hilborn. "Traditional Computing." In Quantum Computing: From Alice to Bob. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192857972.003.0002.

Full text
Abstract:
Alice and Bob explain the difference between classical (traditional) computing and quantum computing, deploying a gentle introduction to classical binary digits (bits) beginning with a brief history of the development of quantum mechanics and computer architecture. The abstract backbone of classical computing is logic gates, which represent changes to input bits under specific rules. These rules, governed by Boolean, logic can be summarized in truth tables, giving the output values for specific input values. The most common classical gates—NOT, AND, NAND, and XOR gates—are introduced. The voca
APA, Harvard, Vancouver, ISO, and other styles
6

Kaufmann, Mareile. "Association." In Making Information Matter. Policy Press, 2023. http://dx.doi.org/10.1332/policypress/9781529233575.003.0005.

Full text
Abstract:
Association has become a central aspect of surveillance and a key practice of making information matter. It is critical to any kind of profiling that we experience on an everyday basis. To associate is to join, to make a connection ‘in an interest, object, employment or purpose’ (Harper, nd). One of the most widespread ways of analysing information is indeed to make a connection between different datasets. In her work on data derivatives Louise Amoore speaks of an ‘ontology of association’ (2011: 27). This means that associating data is not just a knowledge practice, but it describes a specifi
APA, Harvard, Vancouver, ISO, and other styles
7

Shepherdson, J. C. "W. S. Jevons: his logical machine and work on induction and boolean algebra." In Machine Intelligence 15. Oxford University PressOxford, 2000. http://dx.doi.org/10.1093/oso/9780198538677.003.0024.

Full text
Abstract:
Abstract The English scientist William Stanley Jevons, who lived from 1835 to 1882, was one of the architects of symbolic logic. In 1870 he designed and had built the very first logical deduction machine. Since this machine is in the Museum of Science in Oxford where Machine Intelligence 15 was meeting, Donald Michie thought it would be interesting for members to visit it and he invited me to describe it for them before the visit. He also thought that Jevons’ work on induction was related to recent work on inductive logic programming, and asked me to elucidate that relation. Finally I’d like t
APA, Harvard, Vancouver, ISO, and other styles
8

Fieldsteel, Eli. "Core Programming Concepts." In SuperCollider for the Creative Musician. Oxford University PressNew York, 2024. http://dx.doi.org/10.1093/oso/9780197616994.003.0001.

Full text
Abstract:
Abstract This chapter covers the fundamentals of writing and evaluating code in the SuperCollider environment, while refraining from delving into sound-related topics. The overall goal of the chapter is to familiarize the reader with commonplace techniques meant to enhance fluency with day-to-day practices and provide foundational support for subsequent chapters. Topics include navigating the programming environment, understanding basic terminology, and an introduction of common classes, objects, and data types (such as Integers, Floats, Strings, Symbols, Booleans, Arrays, and Functions). Keyb
APA, Harvard, Vancouver, ISO, and other styles
9

Grattan-Guinness, Ivor. "Turing’s mentor, Max Newman." In The Turing Guide. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198747826.003.0052.

Full text
Abstract:
The interaction between mathematicians and mathematical logicians has always been much slighter than one might imagine. This chapter examines the case of Turing’s mentor, Maxwell Hermann Alexander Newman (1897–1984). The young Turing attended a course of lectures on logical matters that Newman gave at Cambridge University in 1935. After briefly discussing examples of the very limited contact between mathematicians and logicians in the period 1850–1930, I describe the rather surprising origins and development of Newman’s own interest in logic. One might expect that the importance to many mathem
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Common Boolean Logic"

1

Manju, S., and V. Sornagopal. "An efficient SQRT architecture of Carry Select adder design by Common Boolean logic." In 2013 International Conference on Emerging Trends in VLSI, Embedded System, Nano Electronics and Telecommunication System (ICEVENT). IEEE, 2013. http://dx.doi.org/10.1109/icevent.2013.6496590.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Console, Marco, Paolo Guagliardo, and Leonid Libkin. "Do We Need Many-valued Logics for Incomplete Information?" In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/851.

Full text
Abstract:
One of the most common scenarios of handling incomplete information occurs in relational databases. They describe incomplete knowledge with three truth values, using Kleene's logic for propositional formulae and a rather peculiar extension to predicate calculus. This design by a committee from several decades ago is now part of the standard adopted by vendors of database management systems. But is it really the right way to handle incompleteness in propositional and predicate logics? Our goal is to answer this question. Using an epistemic approach, we first characterize possible levels of part
APA, Harvard, Vancouver, ISO, and other styles
3

Johnson, K. M., M. Handschy, W. T. Cathey, N. Clark, and D. Walba. "Polarization-Based Optical Parallel Logic Gates Using Ferroelectric Liquid Crystal Spatial Light Modulators." In Optical Computing. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/optcomp.1987.tuc4.

Full text
Abstract:
Optical computing systems offer an increased information processing rate by facilitating parallel computing architectures. Previous experience with electronic computers indicates that desired accuracy can be achieved only with digital computation. Since the simplest digital arithmetic is binary, most recent work on optical computing is focused on the construction of binary optical logic gates. Many practical implementations of such logic gates have been suggested; a recent review is given by Sawchuck and Strand [1]. Most previous schemes operate on light intensity, much in the way that electro
APA, Harvard, Vancouver, ISO, and other styles
4

Drexler, Dominik, Jendrik Seipp, and Hector Geffner. "Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/25.

Full text
Abstract:
Width-based planning methods deal with conjunctive goals by decomposing problems into subproblems of low width. Algorithms like SIW thus fail when the goal is not easily serializable in this way or when some of the subproblems have a high width. In this work, we address these limitations by using a simple but powerful language for expressing finer problem decompositions introduced recently by Bonet and Geffner, called policy sketches. A policy sketch R over a set of Boolean and numerical features is a set of sketch rules that express how the values of these features are supposed to change. Lik
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Common Boolean Logic' for particular source types:
Journal articles
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!

To the bibliography