Results 71 to 80 of about 770 (181)

SMT Attack: Next Generation Attack on Obfuscated Circuits with Capabilities and Performance Beyond the SAT Attacks

Transactions on Cryptographic Hardware and Embedded Systems, 2018
In this paper, we introduce the Satisfiability Modulo Theory (SMT) attack on obfuscated circuits. The proposed attack is the superset of Satisfiability (SAT) attack, with many additional features.
Kimia Zamiri Azar, Hadi Mardani Kamali, Houman Homayoun, Avesta Sasan   +3 more
doaj   +1 more source

SAT-Based Counterexample-Guided Inductive Synthesis of Distributed Controllers

IEEE Access, 2020
This article proposes a new method for automatic synthesis of distributed discrete-state controllers from given temporal specification and behavior examples.
Konstantin Chukharev, Dmitrii Suvorov, Daniil Chivilikhin, Valeriy Vyatkin   +3 more
doaj   +1 more source

Sampling Techniques for Boolean Satisfiability

CoRR, 2014
Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the problems of generating satisfying uniformly at random, and of counting the total number of satisfying assignments have ...
openaire   +2 more sources

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

Journal of Graph Theory, Volume 109, Issue 4, Page 466-480, August 2025.
ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros, Vladimir Gurvich, Martin Milanič, Yushi Uno   +3 more
wiley   +1 more source

Inference of ecological networks and possibilistic dynamics based on Boolean networks from observations and prior knowledge

Methods in Ecology and Evolution, Volume 16, Issue 8, Page 1851-1867, August 2025.
Abstract Being able to infer the interactions between a set of species from observations of the system is of paramount importance to obtain explanatory and predictive models in ecology. We tackled this challenge by employing qualitative modelling frameworks and logic methods for the synthesis of mathematical models that can integrate both observations ...
Loïc Paulevé, Cédric Gaucherel
wiley   +1 more source

Highly durable and energy‐efficient probabilistic bits based on h‐BN/SnS2 interface for integer factorization

InfoMat, Volume 7, Issue 7, July 2025.
This study introduces a novel probabilistic bit (p‐bit) device utilizing advanced materials, hexagonal boron nitride (h‐BN) and tin disulfide (SnS2), to enhance durability and energy efficiency in computational applications. By leveraging the stochastic behavior of electron trapping and detrapping at the h‐BN/SnS2 interface, the device achieves ...
Joon‐Kyu Han, Jun‐Young Park, Shania Rehman, Muhammad Farooq Khan, Moon‐Seok Kim, Sungho Kim   +5 more
wiley   +1 more source

To infinity and beyond: A general framework for scaling economic theories

Theoretical Economics, Volume 20, Issue 2, Page 511-542, May 2025.
Many economic models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness assumptions. Our sufficient conditions are on the theorem statement only, and not on its proof. This results in short proofs,
Yannai A. Gonczarowski, Scott Duke Kominers, Ran I. Shorrer   +2 more
wiley   +1 more source

Accurate Modeling of Continuous-time SAT Solvers in SPICE [PDF]

Radioengineering
Recently, there has been an increasing interest in employing dynamical systems as solvers of NP-complete problems. In this paper, we present accurate implementations of two continuous-time dynamical solvers, known in the literature as analog SAT and ...
Y. V. Pershin, D. C. Nguyen
doaj  

Exploration of Chemical Space Through Automated Reasoning

Angewandte Chemie, Volume 137, Issue 6, February 3, 2025.
In this work we develop an automated reasoning method, COMGEN to determine valid compositions for a given set of domain expert defined constraints. We demonstrate the method in an automated workflow with crystal structure prediction and properties models to locate and predict new potential Li‐ion solid state electrolytes.
Judith Clymo, Christopher M. Collins, Katie Atkinson, Matthew S. Dyer, Michael W. Gaultois, Vladimir V. Gusev, Matthew J. Rosseinsky, Sven Schewe   +7 more
wiley   +1 more source

Fast counting with tensor networks

SciPost Physics, 2019
We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of satisfying ...
Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
doaj   +1 more source