Sciweavers

11 search results - page 2 / 3
» Foundations of Modal Deductive Databases
Sort
View
SEMWEB
2007
Springer
13 years 11 months ago
Logical Foundations of (e)RDF(S): Complexity and Reasoning
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
Jos de Bruijn, Stijn Heymans
DOOD
1995
Springer
102views Database» more  DOOD 1995»
13 years 8 months ago
Active Database Rules with Transaction-Conscious Stable-Model Semantics
Semantics represents a major problem area for active databases inasmuch as (i) there is l framework for defining the abstract semantics of active rules, and (ii) the various syst...
Carlo Zaniolo
FQAS
2004
Springer
104views Database» more  FQAS 2004»
13 years 10 months ago
Logic-Based Integration of Query Answering and Knowledge Discovery
Abstract. There is currently great interest in integrating knowledge discovery research into mainstream database systems. Such an enterprise is nontrivial because knowledge discove...
Marcelo A. T. Aragão, Alvaro A. A. Fernande...
CORR
2011
Springer
185views Education» more  CORR 2011»
12 years 12 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello