Results 91 to 100 of about 263 (134)

Avalanche: adaptation of parallel and distributed computing for dynamic analysis to improve performance of defect detection

Труды Института системного программирования РАН, 2018
This paper focuses on dynamic program analysis optimization through the use of distributed computing scheme and parallel computing for checking satisfiability of Boolean constraint sets.
M. K. Ermakov, A. Y. Gerasimov
doaj  

Integrating Boolean Satisfiability Algorithms into Bayesian Networks for Accelerated Deterministic Inference

Algorithms
Exact probabilistic inference in Bayesian Networks (BNs) becomes increasingly expensive as network size and structural complexity grow, limiting its applicability in time-sensitive decision-support systems.
Efraín Evaristo Díaz Macías, José Steven Cordero Bazurto, Byron Wladimir Oviedo Bayas   +2 more
doaj   +1 more source

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing

Nature Communications
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by
Haesol Im, Fabian Böhm, Giacomo Pedretti, Noriyuki Kushida, Moslem Noori, Elisabetta Valiante, Xiangyi Zhang, Chan-Woo Yang, Tinish Bhattacharya, Xia Sheng, Jim Ignowski, Arne Heittmann, John Paul Strachan, Masoud Mohseni, Raymond Beausoleil, Thomas Van Vaerenbergh, Ignacio Rozada   +16 more
doaj   +1 more source

Boolean Satisfiability [PDF]

, 2009
openaire   +1 more source

A Satisfiability Algorithm for Synchronous Boolean Circuits

IEICE Transactions on Information and Systems, 2021
openaire   +3 more sources

On the Boolean Satisfiability

openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Stochastic Boolean Satisfiability

Journal of Automated Reasoning, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael L. Littman, Stephen M. Majercik, Toniann Pitassi   +2 more
openaire   +2 more sources

Boolean satisfiability for sequence mining

Proceedings of the 22nd ACM international conference on Information & Knowledge Management, 2013
In this paper, we propose a SAT-based encoding for the problem of discovering frequent, closed and maximal patterns in a sequence of items and a sequence of itemsets. Our encoding can be seen as an improvement of the approach proposed in [8] for the sequences of items.
Saïd Jabbour, Lakhdar Sais, Yakoub Salhi   +2 more
openaire   +2 more sources

Connectivity of Boolean satisfiability

2016
[no abstract]
openaire   +1 more source

Boolean satisfiability on a graphics processor

Proceedings of the 20th symposium on Great lakes symposium on VLSI, 2010
Boolean Satisfiability (SAT) is a core NP-complete problem. Several heuristic software and hardware approaches have been proposed to solve this problem. In this paper we present a Boolean satisfiablity approach with a new GPU-enhanced variable ordering heuristic.
Kanupriya Gulati, Sunil P. Khatri
openaire   +2 more sources