Skip to Main content Skip to Navigation
Conference papers

Arc-Consistency for Non-Binary Dynamic CSPs

Christian Bessière 1
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, many filtering techniques have been developed for CSPs. The most used filtering techniques are those achieving arc-consistency. Nevertheless, many reasoning problems in AI need to be expressed in a dynamic environment and almost all the techniques already developed to solve CSPs deal only with static CSPs. So, in this paper, we first recall what we name a dynamic CSP, and then, generalize the incremental algorithm achieving arc-consistency on binary dynamic CSPs to general dynamic CSPs. Like for the binary version of this algorithm, there is an advantage to use our specific algorithm for dynamic CSPs instead of the best static one, GAC4.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02310588
Contributor : Isabelle Gouat <>
Submitted on : Thursday, October 10, 2019 - 12:04:10 PM
Last modification on : Thursday, May 14, 2020 - 6:58:06 PM

File

ecai92.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-02310588, version 1

Collections

Citation

Christian Bessière. Arc-Consistency for Non-Binary Dynamic CSPs. ECAI: European Conference on Artificial Intelligence, Aug 1992, Vienna, Austria. pp.23-27. ⟨lirmm-02310588⟩

Share

Metrics

Record views

35

Files downloads

13