• Home
  • Search
  • Abstract Domains for Constraint Programming, with the Example of Octagons
  • Cite Icon8
  • https://doi.org/10.1109/synasc.2010.69Copy DOI Icon

Abstract Domains for Constraint Programming, with the Example of Octagons

  • Sep 1, 2010
  • C Truchet +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In Constraint Programming (CP), the central notion of consistency can be defined as a fix point of some contracting operators. These operators always deal with cartesian products of domains of the same nature (real intervals, integer sets, etc), due to the cartesian nature of the CSP format. However, \textit{inside} the solving process, there is no particular reason why the domains should be cartesian. In another research field, Abstract Interpretation (AI) in semantics relies on a strong and elegant theory dealing with over-approximations of variables. It allows in particular to mix abstract domains of different kinds (integer, reals...). Several numerical abstract domains for continuous variables have recently been proposed, some of them cartesian, other relational. In this article, we adapt to CP the AI definition of abstract domains. We give an abstract consistency definition, and show it extends the usual CP consistencies. We also give a general solving algorithm for abstract domains. Finally, we propose the octagon abstract domain and study its practical feasibility.

Similar Papers
  • Research Article
  • Citations15

Constraint Satisfaction Problems over Numeric Domains

  • Jan 01, 2017
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Manuel Bodirsky +1
  • Supplementary Content
  • Citations1

Tractable ontology-mediated query answering with datatypes

  • Jun 10, 2019
  • University of Liverpool
  • Lazzarini Lemos
  • Research Article
  • Citations15

An extensible autonomous search framework for constraint programming

  • Jan 01, 2011
  • International Journal of Physical Sciences
  • Broderick Crawford +5
  • Book Chapter
  • Citations10

A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stable Set Problem

  • Jan 01, 2003
  • Willem Jan Van Hoeve
  • Research Article

SOS: a shell for opportunistic scheduling in manufacturing environments

  • Jan 01, 1970
  • WIT Transactions on Information and Communication Technologies
  • Emilio Paolucci +3
  • Book Chapter
  • Citations68

Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning

  • Jan 01, 2016
  • Harsha Nagarajan +3
  • Research Article
  • Citations146

Compiling finite linear CSP into SAT

  • Dec 24, 2008
  • Constraints
  • Naoyuki Tamura +3
  • Book Chapter
  • Citations44

Compiling Finite Linear CSP into SAT

  • Jan 01, 2006
  • Naoyuki Tamura +3
  • Research Article
  • Citations27

A reactive and hybrid constraint solver

  • Mar 01, 2013
  • Journal of Experimental & Theoretical Artificial Intelligence
  • Eric Monfroy +5
  • Research Article

On some relationships between records in the transition from continuous to discrete distributions

  • Jan 01, 2022
  • Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy
  • Mohammad Ahsanullah +2
  • Book Chapter
  • Citations23

Global consistency for continuous constraints

  • Jan 01, 1994
  • D Haroud +1
  • Conference Article
  • Citations20

Synthesis of first-order dynamic programming algorithms

  • Oct 22, 2011
  • Yewen Pu +2
  • Research Article
  • Citations6

A Constraint-Programmed Planner for Deep Space Exploration Problems With Table Constraints

  • Jan 01, 2017
  • IEEE Access
  • Xiao Jiang +1
  • Research Article
  • Citations39

Corrective Line Switching With Security Constraints for the Base and Contingency Cases

  • Feb 01, 2012
  • IEEE Transactions on Power Systems
  • Mingyang Li +4
  • Conference Article
  • Citations35

Corrective line switching with security constraints for the base and contingency cases

  • Jan 01, 2013
  • Mingyang Li +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.