Concept

Complete Boolean algebra

Related publications (39)

Majority-Inverter Graph: A New Paradigm for Logic Optimization

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

In this paper, we propose a paradigm shift in representing and optimizing logic by using only majority (MAJ) and inversion (INV) functions as basic operations. We represent logic functions by Majority-Inverter Graph (MIG): a directed acyclic graph c ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Modelling Architecture Styles

Anastasia Mavridou

Software systems tend to increase over time in size and complexity. Their development usually spans a long period of time and often results in systems that are hard to understand, debug and maintain. Architectures are common means for organising coordinati ...

EPFL2016

Synthesis and spectroscopy of anionic tridentate benzimidazole-pyridine carboxylate and tetrazolate chromophore ligands

Svetlana Eliseeva

We report on seven new anionic benzimidazole-pyridine carboxylate and tetrazolate tridentate (NNO)-N-boolean AND-O-boolean AND and (NNN)-N-boolean AND-N-boolean AND ligands that are modified with chromophore (phenyl, biphenyl, naphthyl) and solubilizing gr ...

Elsevier2015

, ,

In this paper, we present Majority-Inverter Graph (MIG), a novel logic representation structure for efficient optimization of Boolean functions. An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented e ...

2014

We report nine new homoleptic octahedral cobalt(II) complexes Co((NN)-N-boolean AND)(3) and Co((NNN)-N-boolean AND-N-boolean AND)(2) with bidentate or tridentate azole-pyridine ligands (where azole is 1,2,4-triazole or a substituted pyrazole). ...

Elsevier2013

Functional synthesis for linear arithmetic and sets

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algorithms should behave in a predictable way—they should succeed for a well-defin ...

Springer Berlin Heidelberg2013

Steric hindrance at metal centre quenches green phosphorescence of cationic iridium(III) complexes with 1-(2-pyridyl)-pyrazoles

Michael Graetzel, Mohammad Khaja Nazeeruddin, Rosario Scopelliti

Cationic cyclometalated iridium(III) complexes (N,C-2'-2-phenylpyridyl)(2)Ir((NN)-N-boolean AND) with alkyl-substituted 1-(2'-pyridyl)-pyrazole (NN)-N-boolean AND ligands exhibit green phosphorescence from a cyclometalating-ligand-centered excited s ...

Elsevier2013

Near-UV to red-emitting charged bis-cyclometallated iridium(III) complexes for light-emitting electrochemical cells

Michael Graetzel, Mohammad Khaja Nazeeruddin, Rosario Scopelliti, Davide Di Censo

Herein we report a series of charged iridium complexes emitting from near-UV to red using carbene-based (NC)-C-boolean AND: ancillary ligands. Synthesis, photophysical and electrochemical properties of this series are described in detail together with X-ra ...

Royal Society of Chemistry2012

Bright Blue Phosphorescence from Cationic Bis-Cyclometalated Iridium(III) Isocyanide Complexes

Michael Graetzel, Mohammad Khaja Nazeeruddin, Rosario Scopelliti

We report new bis-cyclometalated cationic indium(III) complexes ((CN)-N-boolean AND)(2)Ir(CN-tert-Bu)(2) that have tert-butyl isocyanides as neutral auxiliary ligands and 2-phenylpyridine or 2-(4'-fluoropheny1)-R-pyridines (where R is 4-methoxy, ...

2012

Sets with Cardinality Constraints in Satisfiability Modulo Theories

Viktor Kuncak, Philippe Paul Henri Suter, Robin Steiger

Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that can express constraints on sets of elements and their cardinalities. Problems from verification of complex properties of software often contain fragments that belong to quantifier- ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.