We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
Most of modern systems for information retrieval, fusion and management have to deal more and more with information expressed quatitatively (by linguistic labels) since human repo...
Xinde Li, Xianzhong Dai, Jean Dezert, Florentin Sm...
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Earth Science Markup Language (ESML) is efficient and effective in representing scientific data in an XML-based formalism. However, features of the data being represented are no...
L. Ian Lumb, J. I. Lederman, J. R. Freemantle, Kei...