Show simple item record

dc.contributor.authorFoster, Jeffreyen_US
dc.date.accessioned2007-04-23T18:07:06Z
dc.date.available2007-04-23T18:07:06Z
dc.date.issued1996-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1590en_US
dc.identifier.urihttps://hdl.handle.net/1813/7245
dc.description.abstractCLP(SC) is a constraint logic programming language over set constraints proposed by Kozen [7]. In this paper, we describe a complete C++ implementation of CLP(SC). We describe the data structures used to represent systems of set constraints and an efficient algorithm, a modification of one given in [7], for unifying constraints. In addition, we investigate two further techniques for increasing efficiency: keeping track of variable equalities and doing PROLOG-style unification.en_US
dc.format.extent181143 bytes
dc.format.extent346081 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleCLP(SC): Implementation and Efficiency Considerationsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics