Abstract
We give an overview of some current variable elimination techniques in constraint solving and their applications. We focus on numerical constraints, with variables ranging over the reals, the integers, or the p-adics, but include also constraints of a more combinatorial nature, with Boolean variables of variables in free term structures.
Cite
CITATION STYLE
APA
Weispfenning, V. (2004). Solving constraints by elimination methods. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3097, pp. 336–341). Springer Verlag. https://doi.org/10.1007/978-3-540-25984-8_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free