Results 71 to 80 of about 42,931 (182)

Journal Staff [PDF]

, 2001
The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal ...
Eriksson, John, Höglund, Jonas
core   +1 more source

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems

International Journal of Computational Intelligence Systems, 2017
Clause learning is the key component of modern SAT solvers, while conflict analysis based on the implication graph is the mainstream technology to generate the learnt clauses.
Qingshan Chen, Yang Xu, Jun Liu, Xingxing He   +3 more
doaj   +1 more source

SAT-Based Optimization Framework for Electric Vehicle Charging Station Routing Under Real-World Constraints

World Electric Vehicle Journal
With the rapid adoption of electric vehicles (EVs), optimizing charging infrastructure and route planning has become increasingly crucial. Traditional methods such as Linear Programming (LP) have been widely used to address these challenges.
Shiva Sai Rama Krishna Ravipati, Srinivasa Rao Jalluri, Srikanth Kunta   +2 more
doaj   +1 more source

Explanations for SAT Solvers

, 2023
Les solveurs SAT sont devenus des outils largement utilisés pour résoudre des problèmes de décision ou d’optimisation combinatoires, dans le monde académique comme dans le monde économique. L’une des raisons de leur succès est de parcourir efficacement l’espace de recherche, que l’on peut représenter sous la forme d’un arbre.
openaire   +1 more source

Optimization of Boolean satisfiability solver by caching intermediate results

Труды Института системного программирования РАН, 2018
Recently, a number of dynamic analysis tools were developed that perform tainted data flow tracing and use algorithms for solving the CNF SAT problem for input data generation and path alteration.
S. Vartanov, D. Sidorov
doaj  

preSAT: SAT Solver Description

, 2008
This document briefly describes preSAT 1.0 , a new technique designed to efficiently solve structured CNF formulae.
Piette, Cédric, Hamadi, Youssef, Saïs, Lakhdar   +2 more
openaire   +1 more source

Instance Assignment Coverage Feature for Operation Control of SAT Solver

International Journal of Computational Intelligence Systems
The Conflict-Driven Clause Learning (CDCL) framework integrates multiple heuristic components to solve Boolean satisfiability (SAT) problems through synergistic cooperation.
Zhihui Li, Shuwei Chen, Guanfeng Wu, Yang Xu   +3 more
doaj   +1 more source

Automatic method for searching impossible differentials and zero-correlation linear hulls of ARX block ciphers

网络与信息安全学报, 2017
Firstly,the differences and linear masks propagation equations of ARX ciphers were established.Secondly,the propagation equations were solved by SAT solver and judged valid or not.Finally,differences and linear masks were traversed to search impossible ...
Ya HAN
doaj   +1 more source

MILP-SAT-GNN: Yet Another Neural SAT Solver

We proposes a novel method that enables Graph Neural Networks (GNNs) to solve SAT problems by leveraging a technique developed for applying GNNs to Mixed Integer Linear Programming (MILP). Specifically, k-CNF formulae are mapped into MILP problems, which are then encoded as weighted bipartite graphs and subsequently fed into a GNN for training and ...
Cardillo, Franco Alberto, Khyari, Hamza, Straccia, Umberto   +2 more
openaire   +2 more sources

Back to Basics: Solving Games with SAT

Advances in Electrical and Computer Engineering, 2016
Games became popular, within the formal verification community, after their application to automatic synthesis of circuits from specifications, and they have been receiving more and more attention since then.
QUER, S.
doaj   +1 more source