831 search results - page 45 / 167 » Coalgebraic Correspondence Theory |
105
click to vote
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
104
click to vote
ENGL
2007
14 years 11 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
107
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
123
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...