165 search results - page 3 / 33 » Coping with semilattices of relations in logics with relativ... |
DMDW
2003
13 years 7 months ago
2003
Data Warehouse-(DW) logical design often start with a conceptual schema and then generates relational structures. Applying this approach implies to cope with two main aspects: (i) ...
DASFAA
2004
IEEE
13 years 9 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
DEXA
2009
Springer
14 years 10 days ago
2009
Springer
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
JOLLI
2008
13 years 5 months ago
2008
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
CONCUR
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...