Splitting heuristics for disjunctive numerical constraints | Zendy

Thomas Douillard | Zendy; Christophe Jermann | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Splitting heuristics for disjunctive numerical constraints

Author(s) -

Thomas Douillard,

Christophe Jermann

Publication year - 2008

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/1363686.1363725

Subject(s) - heuristics , constraint (computer aided design) , consistency (knowledge bases) , local consistency , computer science , mathematical optimization , scheme (mathematics) , exploit , numerical analysis , mathematics , algorithm , theoretical computer science , constraint satisfaction problem , artificial intelligence , mathematical analysis , geometry , computer security , probabilistic logic

International audienceRatschan 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research