Results 51 to 60 of about 1,567 (182)
Algorithmic Problems for Computation Trees
LogicsIn this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems.
Mikhail Moshkov
doaj +1 more source
In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro
Advanced Intelligent Systems, EarlyView.This article reported a continuous‐time (CT) Boolean satisfiability (SAT) problem solver using bidirectional 11T‐SRAM macro. The proposed system operates asynchronously using capacitor‐based gradient integration and maximizes the parallelism for SAT solving by in‐memory computing (IMC).
Dongseok Kwon +3 more
wiley +1 more source
Physics‐Grounded Probabilistic Bits for Hardware‐Efficient Intelligent Inference and Optimization
Advanced Intelligent Systems, EarlyView.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
Predicting Propositional Satisfiability Based on Graph Attention Networks
International Journal of Computational Intelligence Systems, 2022 Boolean satisfiability problems (SAT) have very rich generic and domain-specific structures. How to capture these structural features in the embedding space and feed them to deep learning models is an important factor influencing the use of neural ...
Wenjing Chang, Hengkai Zhang, Junwei Luo
doaj +1 more source
Logic programming with satisfiability [PDF]
Theory and Practice of Logic Programming, 2008 Abstract This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other.
Michael Codish +2 more
openaire +3 more sources
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
Two-Variable Logic with Two Order Relations [PDF]
Logical Methods in Computer Science, 2012 It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.
Thomas Schwentick, Thomas Zeume
doaj +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Noûs, EarlyView.ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +1 more source