Improving probability selection based weights for satisfiability problems

Boolean Satisfiability problem (SAT) plays a prominent role in many domains of computer science and artificial intelligence due to its significant importance in both theory and applications. Algorithms for solving SAT problems can be categorized into two main classes: complete algorithms and incompl...

Full description

Saved in:

Bibliographic Details
Published in:	Knowledge-based systems Vol. 245; p. 108572
Main Authors:	Fu, Huimin, Liu, Jun, Wu, Guanfeng, Xu, Yang, Sutcliffe, Geoff
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 07.06.2022 Elsevier Science Ltd
Subjects:	Algorithms Artificial intelligence Boolean algebra Boolean Satisfiability problem Clauses Computer science Heuristic Probability Random walk Search algorithms Stochastic local search Strategies Weighting Weights Stochastic local search Weights Boolean Satisfiability problem
ISSN:	0950-7051, 1872-7409
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!