Sciweavers

961 search results - page 62 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
AAAI
1998
14 years 11 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
WWW
2006
ACM
15 years 10 months ago
Web ontology segmentation: analysis, classification and use
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
Julian Seidenberg, Alan L. Rector
WWW
2006
ACM
15 years 10 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
SEMWEB
2009
Springer
15 years 4 months ago
DSSim Results for OAEI 2009
The growing importance of ontology mapping on the Semantic Web has highlighted the need to manage the uncertain nature of interpreting semantic meta data represented by heterogeneo...
Miklos Nagy, Maria Vargas-Vera, Piotr Stolarski
CIKM
2005
Springer
15 years 3 months ago
Establishing value mappings using statistical models and user feedback
In this paper, we present a “value mapping” algorithm that does not rely on syntactic similarity or semantic interpretation of the values. The algorithm first constructs a st...
Jaewoo Kang, Tae Sik Han, Dongwon Lee, Prasenjit M...