The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria J. Serna +2 more
openaire +2 more sources
Linear Programming Formulation of the Boolean Satisfiability Problem
CoRR, 2008 This paper has been withdrawn. Theorem 38 and Corollary 39 are in error. The modeling needs 9-dimensional z-variables instead of the 8-dimensional variables defined in notations 24.1. The correct modeling is fully detailed in the book available at: http://www.worldscientific.com/worldscibooks/10.1142 ...
openaire +3 more sources
FIMA: A Scalable Ferroelectric Compute-in-Memory Annealer for Accelerating Boolean Satisfiability
IEEE Journal on Exploratory Solid-State Computational Devices and CircuitsIn-memory compute kernels present a promising approach for addressing data-centric workloads. However, their scalability—particularly for computationally intensive tasks solving combinatorial optimization problems such as Boolean satisfiability ...
Mohammad Khairul Bashar +7 more
doaj +1 more source
A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem." [PDF]
, 2021 Michael C. Chavrimootoo, Henry B. Welles
openalex +1 more source
Combinatorial optimization of Boolean satisfiability problems [PDF]
, 2013 The purpose of this thesis is to design, implement and analyse a hybrid genetic algorithm for solving the MAX-3SAT problem. The problem is a well known NP-complete decision problem. Solving this type of problems is highly motivated by its practical use in industry.
openaire +2 more sources
Satisfiability in intuitionistic fuzzy logic with realistic tautology
Kuwait Journal of Science, 2018 Any variable in Intuitionistic Fuzzy Logic (IFL) is either a Realistic Fuzzy Tautology (RFT) with a Truth exceeding one half, or a non-Realistic Fuzzy Tautology (nRFT) with a Truth less than or equal to one half.
Ali Muhammad Rushdi +3 more
doaj
Multipath Detection Using Boolean Satisfiability Techniques
Journal of Computer Networks and Communications, 2011 A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT) techniques to search through the uncertainty region of the multipath
Fadi A. Aloul, Mohamed El-Tarhuni
doaj +1 more source
Using Volunteer Computing to Study Some Features of Diagonal Latin Squares
Open Engineering, 2017 In this research, the study concerns around several features of diagonal Latin squares (DLSs) of small order. Authors of the study suggest an algorithm for computing minimal and maximal numbers of transversals of DLSs.
Vatutin Eduard +3 more
doaj +1 more source
Using deep learning to construct stochastic local search SAT solvers with performance bounds
Machine Learning: Science and TechnologyThe Boolean Satisfiability problem (SAT), as the prototypical $\mathsf{NP}$ -complete problem, is crucial in both theoretical computer science and practical applications.
Maximilian J Kramer +2 more
doaj +1 more source
A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems
The Scientific World Journal, 2014 The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems.
Noureddine Bouhmala
doaj +1 more source