Interval-based QuickXplain Algorithm

Abstract : This article is interested in SMT with NRA theory. This theory is associated to a solver based on Interval Constraint Propagation (ICP) techniques which is easily implementable with IBEX library. The contribution of the paper is the definition of an algorithm dedicated to the conflict analysis step. This algorithm is an adaptation of the QuickXplain algorithm, mainly dedicated to discrete domain Con- straint Satisfaction Problems (CSP), to continuous or numerical CSP.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01583834
Contributor : Alexandre Chapoutot <>
Submitted on : Thursday, September 7, 2017 - 11:11:47 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM

File

quickxplain-continuous.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01583834, version 1

Citation

Adrien Bisutti, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Rémi Delmas. Interval-based QuickXplain Algorithm. 10th Summer Workshop on Interval Methods, and 3rd International Symposium on Set Membership - Applications, Reliability and Theory, Jun 2017, Manchester, United Kingdom. ⟨hal-01583834⟩

Share

Metrics

Record views

211

Files downloads

84