Sciweavers

2035 search results - page 240 / 407
» On the complexity of stratified logics
Sort
View
TCAD
1998
115views more  TCAD 1998»
15 years 6 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram
DLOG
2009
15 years 4 months ago
Soundness Preserving Approximation for TBox Reasoning in R
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
ICPR
2008
IEEE
16 years 7 months ago
Incremental machine learning techniques for document layout understanding
In real-world Digital Libraries, Artificial Intelligence techniques are essential for tackling the automatic document processing task with sufficient flexibility. The great variab...
Floriana Esposito, Marenglen Biba, Stefano Ferilli...
WWW
2005
ACM
16 years 7 months ago
An enhanced model for searching in semantic portals
Semantic Portal is the next generation of web portals that are powered by Semantic Web technologies for improved information sharing and exchange for a community of users. Current...
Lei Zhang, Yong Yu, Jian Zhou, Chenxi Lin, Yin Yan...
WWW
2004
ACM
16 years 7 months ago
A possible simplification of the semantic web architecture
In the semantic web architecture, Web ontology languages are built on top of RDF(S). However, serious difficulties have arisen when trying to layer expressive ontology languages, ...
Bernardo Cuenca Grau