Sciweavers

961 search results - page 2 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
ISPA
2005
Springer
13 years 11 months ago
CMSA: A Method for Construction and Maintenance of Semantic Annotations
An important precondition for the success of the Semantic Web is founded on the principle that the content of web pages will be semantically annotated. In this paper, we propose a ...
Lixin Han, Guihai Chen, Linping Sun, Li Xie
FOGA
2011
12 years 9 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
AUSAI
2005
Springer
13 years 11 months ago
Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
Quoc Bao Vo
WWW
2011
ACM
13 years 10 days ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
IJSI
2010
84views more  IJSI 2010»
13 years 3 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...