We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies ...
We utilize the situation calculus to develop a logical model of hypertext systems. The work builds upon the earlier work of Bieber and Kimbrough in the logical modeling of hyperte...
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...