Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Numerical constraint solving techniques operate in a branch & prune fashion, using consistency enforcement techniques to prune the search space and splitting operations to explore it. Extensions address disjunctions of constraints as well, but usually in a restrictive case and not fitting well the branch&prune scheme. On the other hand, Ratschan has recently proposed a general framework for first-order formulas whose atoms are numerical constraints. It extends the notion of consistency to logical terms, but little is done with respect to the splitting operation. In this paper, we explore the potential of splitting heuristics that exploit the logical structure of disjunctive numerical constraint problems in order to simplify the problem along the search. First experiments on CNF formulas show that interesting solving time gains can be achieved by choosing the right splitting points.