Results 31 to 40 of about 1,182 (134)
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
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
A Deletion Algorithm for the Marginal Problem in Propositional Logic Based on Boolean Arrays
Mathematics, 2023 This paper proposes a deletion algorithm for the marginal problem in propositional logic. The algorithm is based on the general Davis and Putnam deletion algorithm DP, expressed as a bucket elimination algorithm, representing sets of clauses with the ...
Efraín Díaz-Macías, Serafín Moral
doaj +1 more source
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
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
An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity. [PDF]
PLoS ONE, 2015 Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes ...
Changki Hong +3 more
doaj +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
Is a More‐Than‐Minimal State the Meta‐Utopia?
Philosophy &Public Affairs, EarlyView.ABSTRACT Part III of Anarchy, State, and Utopia defends the minimal state as a framework for utopia. On Bader's reconstruction, this defense contains two justificatory strands: a common ground argument, which shows the minimal state to be compatible with the widest range of utopian associations, and an approximation argument, which holds it to be the ...
Carlo Ludovico Cordasco
wiley +1 more source
Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems
MathematicsSolving satisfiability problems is central to many areas of computer science, including artificial intelligence and optimization. Efficiently solving satisfiability problems requires exploring vast search spaces, where search space partitioning plays a ...
Yuexin Huang, Qinzhou Niu, Yanfang Song
doaj +1 more source
Philosophy and Phenomenological Research, EarlyView.ABSTRACT Recent philosophical work on pain distinguishes a variety of pain qualities and the mechanisms that give rise to them, but pain intensity remains a monolithic notion difficult to account for in reductive terms. The reason for this difficulty is that pain intensity is not a unitary phenomenal magnitude; pain is a complex experience featuring ...
Kim Soland
wiley +1 more source