5344 search results - page 280 / 1069 » Privacy-Preserving Set Operations |
150
Voted
TCS
2008
15 years 4 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
142
click to vote
TCS
2008
15 years 4 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
134
click to vote
JANCL
2007
15 years 4 months ago
2007
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
141
Voted
ACS
2000
15 years 4 months ago
2000
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
124
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...