Importance of Variables Semantic in CNF Encoding of Cardinality Constraints
In the satisfiability domain, it is well-known that a SAT algorithm may solve a problem instance easily and another instance hardly, whilst these two instances are equivalent CNF encodings of the original problem. Moreover, different algorithms may disagr
|Collections||ANU Research Publications|
|Source:||Proceedings of The 8th Symposium on Abstraction, Reformulation and Approximation (SARA 2009)|
|01_Anbulagan_Importance_of_Variables_2009.pdf||97.01 kB||Adobe PDF||Request a copy|
|02_Anbulagan_Importance_of_Variables_2009.pdf||354.25 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.