Sciweavers

522 search results - page 78 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
AMW
2010
13 years 10 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
CLA
2004
13 years 10 months ago
A Semi-automatic Method to Ontology Design by Using FCA
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
Hele-Mai Haav
DMDW
2001
91views Management» more  DMDW 2001»
13 years 10 months ago
On Estimating the Cardinality of Aggregate Views
Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not a...
Paolo Ciaccia, Matteo Golfarelli, Stefano Rizzi
CORR
2006
Springer
86views Education» more  CORR 2006»
13 years 8 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu
JCP
2006
91views more  JCP 2006»
13 years 8 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...