Concept
Method of analytic tableaux
Related publications (32)
Label-Free Long-Term Methods for Live Cell Imaging of Neurons: New Opportunities
Georg Fantner, Zahra Ayar Dulabi, Samuel Mendes Leitão
Time-lapse light microscopy combined with in vitro neuronal cultures has provided a significant contribution to the field of Developmental Neuroscience. The establishment of the neuronal polarity, i.e., formation of axons and dendrites, key structures resp ...
MDPI2023Public-Key Encryption with Quantum Keys
In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can ...
Cham2023On Semi-Algebraic Proofs and Algorithms
We give a new characterization of the Sherali-Adams proof system, showing that there is a degree-d Sherali-Adams refutation of an unsatisfiable CNF formula C if and only if there is an ε > 0 and a degree-d conical junta J such that viol_C(x) - ε = J, where ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022On the Power and Limitations of Branch and Cut
The Stabbing Planes proof system [Paul Beame et al., 2018] was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formu ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021A new set of analytical formulae for the computation of the bootstrap current and the neoclassical conductivity in tokamaks
A new set of analytical formulae for calculating the bootstrap current and the neoclassical conductivity in tokamak experiments is presented. Previous works comparing the widely used Sauter model with results of recently developed numerical neoclassical so ...
AMER INST PHYSICS2021Automating cutting planes is NP-hard
We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...
ACM2021Refutation-based synthesis in SMT
Viktor Kuncak, Andrew Joseph Reynolds
We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided ...
SPRINGER2019Bottom slope influence on flow and bedload transfer through contractions
Anton Schleiss, Mário Jorge Rodrigues Pereira Da Franca, Sebastian Schwindt
In-stream open check dams are essential for flood protection at mountain rivers that are characterized by steep slopes (>1%) and sediment-laden flood discharges. These structures comprise an opening acting as a lateral or vertical flow contraction to force ...
2019High Z neoclassical transport: Application and limitation of analytical formulae for modelling JET experimental parameters
Olivier Sauter, Ambrogio Fasoli, Basil Duval, Stefano Coda, Jonathan Graves, Yves Martin, Duccio Testa, Patrick Blanchard, Alessandro Pau, Cristian Sommariva, Henri Weisen, Richard Pitts, Yann Camenen, Jan Horacek, Javier García Hernández, Marco Wischmeier, Nicola Vianello, Mikhail Maslov, Federico Nespoli, Yao Zhou, David Pfefferlé, Davide Galassi, Antonio José Pereira de Figueiredo, Jonathan Marc Philippe Faustin, Liang Yao, Dalziel Joseph Wilson, Hamish William Patten, Samuel Lanthaler, Bernhard Sieglin, Otto Asunta
Heavy impurities, such as tungsten (W), can exhibit strongly poloidally asymmetric density profiles in rotating or radio frequency heated plasmas. In the metallic environment of JET, the poloidal asymmetry of tungsten enhances its neoclassical transport up ...
2018Satisfiability-Based Methods for Digital Circuit Design, Debug, and Optimization
Designing digital circuits well is notoriously difficult. This difficulty stems in part from the very
many degrees of freedom inherent in circuit design, typically coupled with the need to satisfy
various constraints. In this thesis, we demonstrate how for ...
EPFL2018