Results 91 to 100 of about 62,255 (228)
Terminal Satisfiability in GSTE
Journal of Applied Mathematics, 2014 Generalized symbolic trajectory evaluation (GSTE) is an extension of symbolic trajectory evaluation (STE) and a method of model checking. GSTE specifications are given as assertion graphs.
Yongsheng Xu +4 more
doaj +1 more source
Energy‐Efficient Knapsack Optimization Using Probabilistic Memristor Crossbars
Advanced Intelligent Systems, Volume 7, Issue 12, December 2025.The knapsack problem, a nondeterministic polynomial‐time (NP)‐hard combinatorial optimization problem, is solved energy‐efficiently. This work presents an algorithm‐hardware co‐design and implementation for practical (non‐ideal) NP‐hard problems with destabilizing self‐feedback (non‐zero diagonal) and non‐binary Hamiltonian representations under analog
Jinzhan Li, Suhas Kumar, Su‐in Yi
wiley +1 more source
Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability [PDF]
Logical Methods in Computer Science, 2012 G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each other.
Matthias Baaz +2 more
doaj +1 more source
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over a classical standalone simulated annealing (SA). This scatter plot represents the comparison of QESA versus SA for the 924 graphs with the sizes N=60$N=60$, 80 and ...
Seokho Jeong, Juyoung Park, Jaewook Ahn
wiley +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
The bayesian and the abductivist
Noûs, Volume 59, Issue 4, Page 921-937, December 2025.Abstract A major open question in the borderlands between epistemology and philosophy of science concerns whether Bayesian updating and abductive inference are compatible. Some philosophers—most influentially Bas van Fraassen—have argued that they are not.
Mattias Skipper, Olav Benjamin Vassend
wiley +1 more source
Compactness of first-order fuzzy logics
, 2019 One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable.
Khatami, Seyed Mohammad Amin
core
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC [PDF]
, 2010 The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.
Meier, Arne, Schneider, Thomas
core +1 more source
Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale
Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque +4 more
wiley +1 more source
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
, 2008 We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction.
A. Montanari +13 more
core +1 more source