Conference item
Automatic generation of propagation complete SAT encodings
- Abstract:
- Almost all applications of SAT solvers generate Boolean formulae from higher level expression graphs by encoding the semantics of each operation or relation into propositional logic. All non-trivial relations have many different possible encodings and the encoding used can have a major effect on the performance of the system. This paper gives an abstract satisfaction based formalisation of one aspect of encoding quality, the propagation strength, and shows that propagation complete SAT encodings can be modelled by our formalism and automatically computed for key operations. This allows a more rigorous approach to designing encodings as well as improved performance.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 439.7KB, Terms of use)
-
- Publisher copy:
- 10.1007/978-3-662-49122-5_26
Authors
- Publisher:
- Springer, Berlin, Heidelberg
- Host title:
- VMCAI 2016: Verification, Model Checking, and Abstract Interpretation
- Journal:
- international Conference on Verification, Model Checking, and Abstract Interpretation 2016 More from this journal
- Volume:
- 9583
- Pages:
- 536-556
- Series:
- Lecture Notes in Computer Science
- Publication date:
- 2015-12-25
- DOI:
- ISSN:
-
0302-9743
- ISBN:
- 9783662491218
- Pubs id:
-
pubs:573519
- UUID:
-
uuid:a0288804-7811-4e1a-84f2-8972e6960040
- Local pid:
-
pubs:573519
- Source identifiers:
-
573519
- Deposit date:
-
2015-11-16
- ARK identifier:
Terms of use
- Copyright holder:
- Springer-Verlag Berlin Heidelberg
- Copyright date:
- 2015
- Notes:
- Copyright © 2016 Springer-Verlag Berlin Heidelberg. This is the accepted manuscript version of the article. The final version is available online from Springer at: [DOI if we have it]
If you are the owner of this record, you can report an update to it here: Report update to this record