43 search results - page 6 / 9 » Extensional Reasoning |
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
ASP
2001
Springer
14 years 2 days ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
DLOG
2007
13 years 10 months ago
2007
Enabling the Semantic Web requires solving the semantic heterogeneity problem, for which ontology matching methods have been proposed. These methods rely on similarity measures tha...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. As the Semantic Web emerges the problem of semantic heterogeneity is becoming more acute. Ontology matching techniques aim at tackling this problem by establishing corres...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...