Name
Abstract | ||
|---|---|---|
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates), ii) a conjunction of equivalence clauses, and iii) the remaining clauses. We also adopt a new hierarchical cost function that focuses on solving the core components of the problem first. We then show experimentally that our platform not only significantly outperforms existing local search approaches but is also competitive with modern systematic solvers on highly structured problems. |
Year | Venue | Keywords |
|---|---|---|
2008 | national conference on artificial intelligence | core connection,logic gate,minimal dependency lattice,equivalence clause,core component,cnf formula,local search approach,modern systematic solvers,new local search platform,new hierarchical cost function,cost function,local search |
Field | DocType | Citations |
Logic gate,Lattice (order),Computer science,Theoretical computer science,Equivalence (measure theory),Artificial intelligence,Local search (optimization),Machine learning | Conference | 1 |
PageRank | References | Authors |
0.35 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Duc Nghia Pham | 1 | 280 | 17.38 |
| John Thornton | 2 | 1 | 0.35 |
| abdul sattar | 3 | 1389 | 185.70 |