Show simple item record

dc.contributor.authorFeydy, T
dc.contributor.authorStuckey, PJ
dc.contributor.editorGent, IP
dc.date.available2014-05-21T19:46:34Z
dc.date.issued2009-01-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000273241200026&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifier.citationFeydy, T. & Stuckey, P. J. (2009). Lazy Clause Generation Reengineered. Gent, IP (Ed.) PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 5732, pp.352-366. SPRINGER-VERLAG BERLIN. https://doi.org/10.1007/978-3-642-04244-7_29.
dc.identifier.isbn3642042430
dc.identifier.isbn978-3-642-04243-0
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11343/26741
dc.descriptionF1 - Full Written Papers Refereed
dc.description.abstractLazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy clause generation finite domain propagators are considered as clause generators that create a SAT description of their behaviour for a SAT solver. The ability of the SAT solver to explain and record failure and perform conflict directed back-jumping are then applicable to FD problems. The original implementation of lazy clause generation was constructed as a cut down finite domain propagation engine inside a SAT solver. In this paper we show how to engineer a lazy clause generation solver by embedding a SAT solver inside an FD solver. The resulting solver is flexible, efficient and easy to use. We give experiments illustrating the effect of different design choices in engineering the solver.
dc.languageEnglish
dc.publisherSPRINGER-VERLAG BERLIN
dc.source15th International Conference on Principles and Practice of Constraint Programming (CP 2009)
dc.subjectComputer Software not elsewhere classified; Computer Software and Services not elsewhere classified
dc.titleLazy Clause Generation Reengineered
dc.typeConference Paper
dc.identifier.doi10.1007/978-3-642-04244-7_29
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science And Software Engineering
melbourne.source.titlePRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING
melbourne.source.volume5732
melbourne.source.pages352-366
dc.research.codefor080399
dc.research.codeseo2008890299
melbourne.publicationid131762
melbourne.elementsid314227
melbourne.contributor.authorStuckey, Peter
melbourne.contributor.authorFEYDY, THIBAUT
dc.identifier.eissn1611-3349
melbourne.event.locationLisbon, PORTUGAL
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record