Importance of Variables Semantic in CNF Encoding of Cardinality Constraints
Date
Authors
Anbulagan, Anbu
Grastien, Alban
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Press
Abstract
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
Description
Keywords
Citation
Collections
Source
Proceedings of The 8th Symposium on Abstraction, Reformulation and Approximation (SARA 2009)
Type
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31