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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Knowledge-based systems Ročník 245; s. 108572
Hlavní autori:	Fu, Huimin, Liu, Jun, Wu, Guanfeng, Xu, Yang, Sutcliffe, Geoff
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 07.06.2022 Elsevier Science Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!