Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability
Boolean Satisfiability (SAT) is a fundamental NP-complete problem of determining whether there exists an assignment of variables which makes a Boolean formula evaluate to True. SAT is a convenient representation for many naturally occurring optimization and decisions problems such as planning and c...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/6941 |