Skip to content
/ BMM_SAT Public

This is a very simple Bayesian-learning based MAXSAT solver. It will find a solution that satisfies more than 99% of the clauses for very large instances within seconds.

Notifications You must be signed in to change notification settings

h4duan/BMM_SAT

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 

Repository files navigation

This is the first (to my knowledge) Bayesian-learning based MAXSAT solver. It will find a solution that satisfies more than 99% of the clauses for very large instances (millions of literals and clauses) within seconds. The idea is from my supervisor Prof. Pascal Poupart and me.

@Author: Haonan Duan

About

This is a very simple Bayesian-learning based MAXSAT solver. It will find a solution that satisfies more than 99% of the clauses for very large instances within seconds.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages