We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
We propose an approach to analyse the safety of avionic systems that takes into account the impact of computation and communication resource sharing. The approach is made of three...
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...