Publications associées à Terme (logique)

Scalable Logic Rewriting Using Don’t Cares

Giovanni De Micheli, Alessandro Tempia Calvino

Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...

2024

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

EUROPEAN MATHEMATICAL SOC-EMS2022

Structural Rewriting in XOR-Majority Graphs

Giovanni De Micheli, Mathias Soeken, Zhufei Chu

In this paper, we present a structural rewriting method for a recently proposed XOR-Majority graph (XMG), which has exclusive-OR (XOR), majority-of-three (MAJ), and inverters as primitives. XMGs are an extension of Majority-Inverter Graphs (MIGs). Previous ...

ASSOC COMPUTING MACHINERY2019

Corpora Delicti

Alexandre Blanc, Marco Bakker

CORPORA DELICTI, The Significant Detail. The Corpus Delicti is the evidence of a crime. The term denotes the formation of a proof that allows the unmasking of a perpetrator. In the realm of interpretation and language, it could reveal matter on which an ac ...

MANSLAB2017

Linear-Rational Term Structure Models

Damir Filipovic, Martin Larsson

We introduce the class of linear-rational term structure models in which the state price density is modeled such that bond prices become linear-rational functions of the factors. This class is highly tractable with several distinct advantages: (i) ensures ...

Wiley2017

A Novel Basis for Logic Rewriting

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Winston Jason Haaswijk

Given a set of logic primitives and a Boolean function, exact synthesis finds the optimum representation (e.g., depth or size) of the function in terms of the primitives. Due to its high computational complexity, the use of exact synthesis is limite ...

Ieee2017

On Satisfiability for Quantified Formulas in Instantiation-Based Procedures

Viktor Kuncak, Nicolas Charles Yves Voirol

Procedures for first-order logic with equality are used in many modern theorem provers and solvers, yet procedure termination in case of interesting sub-classes of satisfiable formulas remains a challenging problem. We present an instantiation-based semi-d ...

2016

Saturation of the response to stochastic forcing in two-dimensional backward-facing step flow: A self-consistent approximation

François Gallaire, Vladislav Mantic Lugo

Selective noise amplifiers are characterized by large linear amplification to external perturbations in a particular frequency range despite their global linear stability. Applying a stochastic forcing with increasing amplitude, the response undergoes a st ...

Amer Physical Soc2016

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Terme (logique)

Scalable Logic Rewriting Using Don’t Cares

Fourier non-uniqueness sets from totally real number fields

Structural Rewriting in XOR-Majority Graphs

Digital epidemiology: what is it, and where is it going?

Corpora Delicti

Linear-Rational Term Structure Models

Higher-Order Subtyping with Type Intervals

A Novel Basis for Logic Rewriting

On Satisfiability for Quantified Formulas in Instantiation-Based Procedures

Saturation of the response to stochastic forcing in two-dimensional backward-facing step flow: A self-consistent approximation

Graph Chatbot

Chattez avec Graph Search

Corpora Delicti

A Novel Basis for Logic Rewriting

Linear-Rational Term Structure Models

On Satisfiability for Quantified Formulas in Instantiation-Based Procedures

Structural Rewriting in XOR-Majority Graphs

Fourier non-uniqueness sets from totally real number fields

Scalable Logic Rewriting Using Don’t Cares

Digital epidemiology: what is it, and where is it going?

Higher-Order Subtyping with Type Intervals

Saturation of the response to stochastic forcing in two-dimensional backward-facing step flow: A self-consistent approximation