Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
Martin Wirsing, Grit Denker, Carolyn L. Talcott, A...
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
We describe our effort to evaluate the syntax and constraints of Promise Theory using a tool developed in the Maude framework. Through the development of a Maude module we are able...
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...