Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorNightingale, Peter
dc.contributor.authorSpracklen, Patrick
dc.contributor.authorMiguel, Ian James
dc.contributor.editorPesant, Gilles
dc.date.accessioned2016-10-01T23:45:31Z
dc.date.available2016-10-01T23:45:31Z
dc.date.issued2015-10
dc.identifier.citationNightingale , P , Spracklen , P & Miguel , I J 2015 , Automatically improving SAT encoding of constraint problems through common subexpression elimination in Savile Row . in G Pesant (ed.) , Principles and Practice of Constraint Programming : 21st International Conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015, Proceedings . vol. 9255 , Lecture Notes in Computer Science , vol. 9255 , Springer , pp. 330-340 , 21st International Conference on Principles and Practice of Constraint Programming (CP 2015) , Cork , Ireland , 31/08/15 . https://doi.org/10.1007/978-3-319-23219-5_23en
dc.identifier.citationconferenceen
dc.identifier.isbn978-3-319-23218-8
dc.identifier.isbn978-3-319-23219-5
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 200630262
dc.identifier.otherPURE UUID: 34fe48ff-e67b-49ac-bf7b-9fddc9ef0092
dc.identifier.otherScopus: 84944529161
dc.identifier.otherORCID: /0000-0002-5052-8634/work/34029950
dc.identifier.otherWOS: 000364707100023
dc.identifier.otherORCID: /0000-0002-6930-2686/work/68281463
dc.identifier.urihttp://hdl.handle.net/10023/9589
dc.description.abstractThe formulation of a Propositional Satisfiability (SAT) problem instance is vital to efficient solving. This has motivated research on preprocessing, and inprocessing techniques where reformulation of a SAT instance is interleaved with solving. Preprocessing and inprocessing are highly effective in extending the reach of SAT solvers, however they necessarily operate on the lowest level representation of the problem, the raw SAT clauses, where higher-level patterns are difficult and/or costly to identify. Our approach is different: rather than reformulate the SAT representation directly, we apply automated reformulations to a higher level representation (a constraint model) of the original problem. Common Subexpression Elimination (CSE) is a family of techniques to improve automatically the formulation of constraint satisfaction problems, which are often highly beneficial when using a conventional constraint solver. In this work we demonstrate that CSE has similar benefits when the reformulated constraint model is encoded to SAT and solved using a state-of-the-art SAT solver. In some cases we observe speed improvements of over 100 times.
dc.format.extent11
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofPrinciples and Practice of Constraint Programmingen
dc.relation.ispartofseriesLecture Notes in Computer Scienceen
dc.rights© 2015, Springer International Publishing Switzerland. This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://dx.doi.org/10.1007/978-3-319-23219-5_23en
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject3rd-DASen
dc.subject.lccQA75en
dc.titleAutomatically improving SAT encoding of constraint problems through common subexpression elimination in Savile Rowen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews.Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1007/978-3-319-23219-5_23
dc.date.embargoedUntil2016-10-01
dc.identifier.urlhttp://booleconferences.ucc.ie/cp2015en


This item appears in the following Collection(s)

Show simple item record