Results 61 to 70 of about 263 (134)

Automatic Screening for Perturbations in Boolean Networks

Frontiers in Physiology, 2018
A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology.
Julian D. Schwab, Julian D. Schwab, Hans A. Kestler   +2 more
doaj   +1 more source

Combining solutions of the optimum satisfiability problem using evolutionary tunneling

Mendel, 2020
The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true.
Rodrigo Ferreira da Silva, Lars Magnus Hvattum, Fred Glover   +2 more
doaj   +1 more source

Boolean Satisfiability

, 2020
The Boolean Satisfiability Problem is also the first problem proven to be NP-complete. A problem is NP-complete if it belongs to the set (or "class" if you prefer) of the hardest problems in NP-hardest in the sense that every problem ever exists in NP can be reduced to them. (Thus being able to solve a NP-complete problem is equivalent to being able to
openaire   +1 more source

Transforming Natural Language Requirements to Formalism Using LLMs

Systems Engineering, Volume 29, Issue 2, Page 195-204, March 2026.
ABSTRACT Logical formalism is the use of mathematical models, logical symbols and operators, and logical reasoning to express ideas precisely and unambiguously. Such precision is needed in systems engineering to avoid misunderstandings and misinterpretations.
Baoluo Meng, Robert Lorch, Kit Siu, Michael Durling, Sarat Chandra Varanasi, Saswata Paul, Abha Moitra   +6 more
wiley   +1 more source

Optimizing Test Pattern Compaction with Boolean Satisfiability Attack

Chips
Test time per chip plays an essential role in manufacturing tests. Keeping a low number of test patterns becomes one of the prime objectives in concurrence with achieving the desired fault coverage.
Yadi Zhong
doaj   +1 more source

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

The Boolean SATisfiability Problem in Clifford algebra [PDF]

Theoretical Computer Science, 2019
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
openaire   +5 more sources

Mapping Quantum Computing Techniques for NP‐Hard Problems in Operations Management and Operations Research

Engineering Reports, Volume 8, Issue 2, February 2026.
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad, Patricia Gomes Ferreira da Costa, Thaís Spiegel, Hélcio de Oliveira Rocha   +3 more
wiley   +1 more source

Is Computing with Light All You Need? A Perspective on Codesign for Optical Artificial Intelligence and Scientific Computing

Advanced Intelligent Systems, Volume 8, Issue 1, January 2026.
This perspective article considers what computations optical computing can and should enable. Focusing upon free‐space optical computing, it argues that a codesign approach whereby materials, devices, architectures, and algorithms are simultaneously optimized is needed.
Prasad P. Iyer, Gaurang R. Bhatt, Saaketh Desai, Elliot J. Fuller, Corinne M. Teeter, François Léonard, Craig M. Vineyard   +6 more
wiley   +1 more source