Computer Science – Artificial Intelligence
Scientific paper
2011-08-30
Computer Science
Artificial Intelligence
Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 201
Scientific paper
In this paper, we present domain-specific languages (DSLs) that we devised for their use in the implementation of a finite domain constraint programming system, available as library(clpfd) in SWI-Prolog and YAP-Prolog. These DSLs are used in propagator selection and constraint reification. In these areas, they lead to concise specifications that are easy to read and reason about. At compilation time, these specifications are translated to Prolog code, reducing interpretative run-time overheads. The devised languages can be used in the implementation of other finite domain constraint solvers as well and may contribute to their correctness, conciseness and efficiency.
No associations
LandOfFree
Domain-specific Languages in a Finite Domain Constraint Programming System does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Domain-specific Languages in a Finite Domain Constraint Programming System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain-specific Languages in a Finite Domain Constraint Programming System will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-729099