A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classe...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhang, Zaijun, Xu, Daoyun, Zhou, Jincheng
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8001598/
https://www.ncbi.nlm.nih.gov/pubmed/33806451
http://dx.doi.org/10.3390/e23030303

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8001598/
https://www.ncbi.nlm.nih.gov/pubmed/33806451
http://dx.doi.org/10.3390/e23030303

Ejemplares similares