Skip to Main content Skip to Navigation
Journal articles

Multi-variable distributed backtracking with sessions

Abstract : The Constraint Satisfaction Problem (CSP) formalism is used to represent many combinatorial decision problems instances simply and efficiently. However, many such problems cannot be solved on a single, centralized computer for various reasons (e.g., their excessive size or privacy). The Distributed CSP (DisCSP) extends the CSP model to allow such combinatorial decision problems to be modelled and handled. In this paper, we propose a complete DisCSP-solving algorithm, called Distributed Backtracking with Sessions (DBS), which can solve DisCSP so that each agent encapsulates a whole “complex” problem with many variables and constraints. We prove that the algorithm is sound and complete, and generates promising experimental results.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03578668
Contributor : Julie Cagniard Connect in order to contact the contributor
Submitted on : Thursday, February 17, 2022 - 2:10:10 PM
Last modification on : Monday, May 2, 2022 - 2:58:01 PM

Identifiers

Collections

Citation

René Mandiau, Julien Vion, Sylvain Piechowiak, Pierre Monier. Multi-variable distributed backtracking with sessions. Applied Intelligence, Springer Verlag (Germany), 2014, 41 (3), pp.736-758. ⟨10.1007/s10489-014-0532-2⟩. ⟨hal-03578668⟩

Share

Metrics

Record views

12