DeepAI AI Chat

A Probabilistic Approach to Satisfiability of Propositional Logic Formulae

12/04/2019

∙

by Reazul Hasan Russel, et al.

∙

University of New Hampshire

∙

∙

We propose a version of WalkSAT algorithm, named as BetaWalkSAT. This method uses probabilistic reasoning for biasing the starting state of the local search algorithm. Beta distribution is used to model the belief over boolean values of the literals. Our results suggest that, the proposed BetaWalkSAT algorithm can outperform other uninformed local search approaches for complex boolean satisfiability problems.

∙ 08/23/2021

Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT

Partial MaxSAT (PMS) and Weighted Partial MaxSAT (WPMS) are both practic...

0 Jiongzhi Zheng, et al. ∙

∙ 04/16/2020

Local Search Trajectories over S-box Space

The study of S-box properties relations is an interesting problem. In th...

0 Ismel Martínez-Díaz, et al. ∙

∙ 09/09/2011

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability

This work focuses on improving state-of-the-art in stochastic local sear...

0 Anton Belov, et al. ∙

∙ 07/30/2020

Improving probability selecting based weights for Satisfiability Problem

The Boolean Satisfiability problem (SAT) is important on artificial inte...

8 Huimin Fu, et al. ∙

∙ 01/26/2020

NLocalSAT: Boosting Local Search with Solution Prediction

The boolean satisfiability problem is a famous NP-complete problem in co...

0 Wenjie Zhang, et al. ∙

∙ 09/09/2011

Generalizing Boolean Satisfiability III: Implementation

This is the third of three papers describing ZAP, a satisfiability engin...

0 H. E. Dixon, et al. ∙

∙ 02/23/2021

Structural Similarity of Boundary Conditions and an Efficient Local Search Algorithm for Goal Conflict Identification

In goal-oriented requirements engineering, goal conflict identification ...

0 Hongzhen Zhong, et al. ∙