Models and emerging trends of concurrent constraint programming

Olarte, Carlos; Rueda, Camilo; Valencia, Frank

doi:10.1007/s10601-013-9145-3

Cited by 34 publications

(28 citation statements)

References 183 publications

(262 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recall that a constraint satisfaction problem (CSP) is described in terms of a set of variables V, a collection of potential values D for each variable and a set of relations C over those variables, referred to as constraints [14,15]. A CSP solution is an assignment of values for each variable in such a way that every constraint in C is satisfied.…”

Section: Facade-layout Synthesis As a Cspmentioning

confidence: 99%

Open Packing for Facade-Layout Synthesis Under a General Purpose Solver

Barco

Fages²,

Vareilles³

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Facade-layout synthesis occurs when renovating buildings to improve their thermal insulation and reduce the impact of heating on the environment. This interesting problem involves to cover a facade with a set of disjoint and configurable insulating panels. Therefore, it can be seen as a constrained rectangle packing problem, but for which the number of rectangles to be used and their size are not known a priori. This paper proposes an efficient way of solving this problem using constraint programming. The model is based on an open variant of the DiffN global constraint in order to deal with an unfixed number of rectangles, as well as a simple but efficient search procedure to solve this problem. An empirical evaluation shows the practical impact of every choice in the design of our model. A prototype implemented in the general purpose solver Choco is intended to assist architect decision-making in the context of building thermal retrofit.

show abstract

Section: Facade-layout Synthesis As a Cspmentioning

confidence: 99%

Open Packing for Facade-Layout Synthesis Under a General Purpose Solver

Barco

Fages²,

Vareilles³

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A CSP is described in terms of a set of variables V, a collection of potential values D for each variable and a set of relations C over those variables, referred to as constraints [15,16]. A constraint is a relation representing partial information over the variables of the problem.…”

Section: Facades a Facade (Presented Inmentioning

confidence: 99%

Layout Synthesis for Symmetrical Facades

Barco

Vareilles

Aldanondo

et al. 2015

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

“…The increasing interest in the community for this powerful model of concurrency is perhaps due to its simplicity and tight connection to logic: processes tell and ask information (formulas in logic) in a store of partial information; moreover, processes can be seen as both computing agents and as logic formulas. The use of ccp models has pervaded different areas in science (e.g., biochemical systems), engineering (e.g., security protocols, mobile and service oriented computing and social networks) and even the arts (e.g., tools for multimedia interaction)-see a survey in [17]. Nevertheless, in spite of the many semantic and logical frameworks designed to reason about ccp processes, the automatic verification of ccp programs has received little attention so far.…”

Section: Introductionmentioning

confidence: 99%

A Symbolic Model for Timed Concurrent Constraint Programming

Arias

Guzmán

Olarte

2015

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method.

show abstract

Models and emerging trends of concurrent constraint programming

Cited by 34 publications

References 183 publications

Open Packing for Facade-Layout Synthesis Under a General Purpose Solver

Open Packing for Facade-Layout Synthesis Under a General Purpose Solver

Layout Synthesis for Symmetrical Facades

A Symbolic Model for Timed Concurrent Constraint Programming

Contact Info

Product

Resources

About