Sciweavers

77 search results - page 10 / 16
» Distinguishing Answers in Conceptual Graph Knowledge Bases
Sort
View
SIGMOD
2008
ACM
118views Database» more  SIGMOD 2008»
13 years 8 months ago
NAGA: harvesting, searching and ranking knowledge
The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet mor...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
CAISE
2006
Springer
14 years 16 days ago
Detecting Changes in Ontologies via DAG Comparison
Abstract. Ontologies are shared conceptualizations of a certain domain. As such domains may change, also changes in the ontologies have to be considered, as otherwise there is no w...
Johann Eder, Karl Wiggisser
JACM
2010
137views more  JACM 2010»
13 years 7 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
DM
2006
87views more  DM 2006»
13 years 8 months ago
A vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
Anne Berry, Pinar Heggernes, Yngve Villanger
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 2 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han