Results 91 to 100 of about 18,245 (221)
Classical and quantum satisfiability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present the linear algebraic definition of QSAT and propose a direct logical characterization of such a definition. We then prove that this logical version of QSAT is not an extension of classical satisfiability problem (SAT).
Anderson de Araújo, Marcelo Finger
doaj +1 more source
CoRR, 2014 We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here a novel direct approach to LTLf satisfiability checking, where we take advantage of the ...
Jianwen Li +4 more
openaire +3 more sources
Physics‐Grounded Probabilistic Bits for Hardware‐Efficient Intelligent Inference and Optimization
Advanced Intelligent Systems, Volume 8, Issue 10, October 2026.Si–SiNx interface traps are harnessed as a complementary metal–oxide–semiconductor‐compatible source of controllable randomness for probabilistic bits. Pulse‐width‐programmed stochastic capture converts nanoscale defect dynamics into Boltzmann‐consistent binary outputs, while a physics‐based Simulation Program with Integrated Circuit Emphasis model ...
Dokyoung Lee +3 more
wiley +1 more source
Applying UCT to Boolean Satisfiability
, 2011 In this paper we perform a preliminary investigation into the application of sampling-based search algorithms to satisfiability testing of propositional formulas in Conjunctive Normal Form (CNF).
Raghuram Ramanujan +4 more
core +1 more source
Quantum Spectral Clustering Framework via Compact Circuit Structures
Advanced Quantum Technologies, Volume 9, Issue 10, October 2026.Can a quantum computer cluster data without ever reading the full kernel? This work shows that compact, parameterized circuits estimate the Laplacian quadratic forms directly and perform clustering, without explicitly constructing the full quantum fidelity‐kernel matrix.
Hyeong‐gyu Kim +2 more
wiley +1 more source
SAT-Based Explicit LTLf Satisfiability Checking [PDF]
, 2018 We present a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced ...
Vardi, Moshe +7 more
core +1 more source
LOGIC, PRIMES AND COMPUTATION: A TALE OF UNREST
TASK Quarterly, 2005 The early connections between Mathematical Logic and Computer Science date back to the thirties and to the birth itself of modern Theoretical Computer Science, and concern computability.
STEFANO LEONESI, CARLO TOFFALORI
doaj
Device‐to‐System Perspectives on Scalable Ising Machines for Physics‐Driven Computing
Advanced Quantum Technologies, Volume 9, Issue 10, October 2026.Emerging‐device‐based Ising machines exploit conductance programmability, intrinsic stochasticity, and oscillator dynamics as physical primitives for combinatorial optimization. This review establishes a device‐to‐system framework linking these physical properties to computational functions and crossbar‐based, stochastic p‐bit, and oscillator‐based ...
Sangwook Youn +4 more
wiley +1 more source
Acta Informatica, 1990 A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
openaire +2 more sources
Generalized modal satisfiability
Journal of Computer and System Sciences, 2010 32 pages, 3 figures.
Edith Hemaspaandra +2 more
openaire +3 more sources