Search
Search Results
-
Solving the SAT problem with the string multiset rewriting calculus
In this paper, we develop computing machinery within the framework of the String Multiset Rewriting calculus (SMSR), as defined by Barbuti et al. [
4 ],... -
Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
Spiking neural P systems (SNPS) are variants of the third-generation neural networks. In the last few decades, different variants of SNPS models have...
-
On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem
This paper explores the conditions which make a regular balanced random ( k ,2 s )-CNF formula (1,0)-unsatisfiable with high probability. The conditions...
-
Tackling the Polarity Initialization Problem in SAT Solving Using a Genetic Algorithm
The Boolean satisfiability problem holds a significant place in computer science, finding applications across various domains. This problem consists...
-
Maximizing a deep submodular function optimization with a weighted MAX-SAT problem for trajectory clustering and motion segmentation
Computer vision models are commonly defined for maximum constrained submodular functions lies at the core of low-level and high-level models. In such...
-
Exploring the Limits of Problem-Specific Adaptations of SAT Solvers in SAT-Based Cryptanalysis
SAT-based cryptanalysis implies using algorithms for solving the Boolean Satisfiability (SAT) problem to perform cryptographic attacks. It is a...
-
Properties of the satisfiability threshold of the strictly d-regular random (3,2s)-SAT problem
A k -CNF (conjunctive normal form) formula is a regular ( k, s )-CNF one if every variable occurs s times in the formula, where k ⩾ 2 and s > 0 are...
-
Effective Problem Solving Using SAT Solvers
In this article we demonstrate how to solve a variety of problems and puzzles using the built-in SAT solver of the computer algebra system Maple....
-
A Semi-Tensor Product Based All Solutions Boolean Satisfiability Solver
Boolean satisfiability (SAT) is widely used as a solver engine in electronic design automation (EDA). Typically, SAT is used to determine whether one...
-
Towards better heuristics for solving bounded model checking problems
This paper presents a new way to improve the performance of the SAT-based bounded model checking problem on sequential and parallel procedures by...
-
Variational satisfiability solving: efficiently solving lots of related SAT problems
Incremental satisfiability (SAT) solving is an extension of classic SAT solving that enables solving a set of related SAT problems by identifying and...
-
Function Synthesis for Maximizing Model Counting
Given a boolean formula \(\phi (X, Y, Z)\) , the...
-
Scheduling through logic-based tools
A scheduling problem can be defined in a nutshell as the problem of determining when and how the activities of a project have to be run, according to...
-
Solving SAT with P systems with anti-membranes
P systems with anti-membranes represent a variant of P systems with anti-matter in which the concept of annihilation between a matter object and its...
-
Logic-based cognitive planning for conversational agents
This paper presents a novel approach to cognitive planning based on an NP-complete logic of explicit and implicit belief whose satisfiability...
-
On MAX–SAT with Cardinality Constraint
We consider the weighted MAX–SAT problem with an additional constraint that at most k variables can be set to true. We call this problem k...
-
Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances
The Maximum Boolean Satisfiability Problem (also known as the Max-SAT problem) is the problem of determining the maximum number of disjunctive...
-
High Quality Circuit-Based 3-SAT Map**s for Oscillator Ising Machines
3-SAT is a class of NP-hard combinatorial optimization problems that Ising machines have had difficulty solving successfully. Solution success rate...