2062 search results - page 245 / 413 » Derivatives of Logical Formulas |
181
click to vote
CIKM
2005
Springer
16 years 2 days ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
149
click to vote
FC
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...
160
click to vote
FROCOS
2005
Springer
16 years 2 days ago
2005
Springer
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
156
click to vote
AIMSA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The problem of finding an agreement on the meaning of heterogeneous schemas is one of the key issues in the development of the Semantic Web. In this paper, we propose a ...
168
click to vote
CAV
2003
Springer
15 years 11 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...