Problem Frames are a systematic approach to the decomposition of problems that allows us to relate requirements, domain properties, and machine specifications. Having decomposed a...
Robin C. Laney, Leonor Barroca, Michael Jackson, B...
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
d Abstract) Marcos K. Aguilera1 , Eli Gafni1,2 , and Leslie Lamport1 1 Microsoft Research Silicon Valley 2 UCLA We propose and solve a synchronization problem called the mailbox pr...
Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport