Sciweavers

2035 search results - page 273 / 407
» On the complexity of stratified logics
Sort
View
106
Voted
CSL
2008
Springer
15 years 2 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
119
Voted
DEXAW
2008
IEEE
145views Database» more  DEXAW 2008»
15 years 2 months ago
ECQ: A Simple Query Language for the Semantic Web
With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems. In ...
María del Mar Roldán García, ...
109
Voted
ECBS
2008
IEEE
124views Hardware» more  ECBS 2008»
15 years 2 months ago
Hierarchical Model to Develop Component-Based Systems
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...
Abdelkrim Amirat, Mourad Oussalah
150
Voted
AAAI
2010
15 years 2 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
102
Voted
AMW
2010
15 years 2 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