Results 91 to 100 of about 44,054 (190)
Fast LTL Satisfiability Checking by SAT Solvers [PDF]
, 2014 Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures.
He, Jifeng +4 more
core
Generalized Satisfiability Problems via Operator Assignments
, 2017 Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used
A Acín +12 more
core +1 more source
IET Smart Energy Systems, Volume 2, Issue 1, Page 34-48, March 2026.An adaptive chance‐constrained hybrid SOCP‐Based ACOPF for coordinated optimisation of integrated source–grid–load–storage systems is presented. The coordinated optimisation of integrated source–grid–load–storage (SGLS) systems is challenged by renewable energy uncertainty, complex industrial load characteristics and stringent policy constraints ...
Mingyue He +6 more
wiley +1 more source
New Journal of Physics, 2016 We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists ...
Salvatore Mandrà +2 more
doaj +1 more source
A Case for Contingent Absurdity
European Journal of Philosophy, Volume 34, Issue 1, Page 266-280, March 2026.Abstract A popular view on existential absurdity holds that if life is absurd, it must be inescapably so. In opposition to this view, I argue that the concept of existential absurdity allows for life to be contingently absurd. In Nausea (1938) and Being and Nothingness (1943), Jean‐Paul Sartre puts forward two distinct conceptions of an absurd life ...
Thom Hamer
wiley +1 more source
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +2 more
doaj +1 more source
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
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 +3 more
wiley +1 more source
On the Satisfiability of Local First-Order Logics with Data [PDF]
Logical Methods in Computer ScienceWe study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality.
Benedikt Bollig +2 more
doaj +1 more source
, 2018 We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function.
De Micheli, Giovanni +3 more
core +1 more source