Sciweavers

146 search results - page 18 / 30
» Data Complexity in the EL Family of Description Logics
Sort
View
DOOD
1993
Springer
135views Database» more  DOOD 1993»
13 years 11 months ago
A Deductive and Typed Object-Oriented Language
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
René Bal, Herman Balsters
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 11 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
DEXAW
1999
IEEE
137views Database» more  DEXAW 1999»
13 years 12 months ago
Reasoning with Enhanced Temporal Entity-Relationship Models
Recent efforts in the Conceptual Modelling community have been devoted to properly capturing time-varying information, and several proposals of temporally enhanced Entity-Relation...
Alessandro Artale, Enrico Franconi
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
A notation and system for expressing and executing cleanly typed workflows on messy scientific data
The description, composition, and execution of even logically simple scientific workflows are often complicated by the need to deal with "messy" issues like heterogeneou...
Yong Zhao, James E. Dobson, Ian T. Foster, Luc Mor...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart