Abstract
Many works about abstraction of Constraint Satisfaction Problems (CSPs) introduce materials in order to build specific abstractions. But, to our best knowledge, only two works [2, 9] were devoted to defining frameworks of CSP abstraction. In this paper, we try to go one step beyond by proposing an original and unifying framework with a two-fold objective: a proposal sufficiently general to embrace previous works and to envision new forms of abstraction, and sufficiently precise to decide without any ambiguity the correctness of a given abstraction.
Cite
CITATION STYLE
Lecoutre, C., Merchez, S., Boussemart, F., & Gregoire, E. (2000). A CSP abstraction framework. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1864, pp. 164–184). Springer Verlag. https://doi.org/10.1007/3-540-44914-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
