Show simple item record

AuthorRaiser, Frankdc.contributor.author
Date of accession2016-03-14T15:19:29Zdc.date.accessioned
Available in OPARU since2016-03-14T15:19:29Zdc.date.available
Year of creation2008dc.date.created
AbstractConstraint programming often involves global constraints, which have been catalogued in [1] and for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR solvers for the set of global constraints which can be defined by specific automata described in [2]. The solvers only need to be generated once and achieve arc-consistency for over 40 global constraints.dc.description.abstract
Languageendc.language.iso
PublisherUniversität Ulmdc.publisher
LicenseStandard (Fassung vom 03.05.2003)dc.rights
Link to license texthttps://oparu.uni-ulm.de/xmlui/license_v1dc.rights.uri
KeywordConstraintsdc.subject
KeywordGlobal constraintsdc.subject
Dewey Decimal GroupDDC 004 / Data processing & computer sciencedc.subject.ddc
LCSHConstraint programming (Computer science)dc.subject.lcsh
TitleSemi-automatic generation of CHR solvers from global constraint automatadc.title
Resource typeArbeitspapierdc.type
DOIhttp://dx.doi.org/10.18725/OPARU-978dc.identifier.doi
URNhttp://nbn-resolving.de/urn:nbn:de:bsz:289-vts-63227dc.identifier.urn
GNDCHR <Programmiersprache>dc.subject.gnd
GNDConstraint-Programmierungdc.subject.gnd
FacultyFakultät für Ingenieurwissenschaften und Informatikuulm.affiliationGeneral
Citation of original publ.Ulmer Informatik-Berichte, Nr. 2008-03, Februar 2008uulm.citationOrigPub
Date of activation2008-02-27T11:26:05Zuulm.freischaltungVTS
Peer reviewneinuulm.peerReview
Shelfmark print versionQAA 5/A4.2008,03uulm.shelfmark
DCMI TypeTextuulm.typeDCMI
VTS-ID6322uulm.vtsID
CategoryPublikationenuulm.category
Ulm seriesUlmer Informatik-Berichteuulm.seriesUlmName
University Bibliographyjauulm.unibibliographie


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record