A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form
Sign Up to like & getrecommendations! Published in 2021 at "Entropy"
DOI: 10.3390/e23030303
Abstract: 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… read more here.
Keywords: formula; entropy; propositional formulas; formulas conjunctive ... See more keywords