Sciweavers

107 search results - page 7 / 22
» Reasoning on regular path queries
Sort
View
HIS
2009
13 years 7 months ago
Implementing and Evaluating a Rule-Based Approach to Querying Regular EL+ Ontologies
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
Yuting Zhao, Jeff Z. Pan, Yuan Ren
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
13 years 11 months ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...
DATESO
2010
184views Database» more  DATESO 2010»
13 years 7 months ago
iXUPT: Indexing XML Using Path Templates
The XML format has become the standard for data exchange because it is self-describing and it stores not only information but also the relationships between data. Therefore it is u...
Tomás Bartos, Ján Kasarda
CADE
2011
Springer
12 years 9 months ago
Compression of Propositional Resolution Proofs via Partial Regularization
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel ...
ESWS
2007
Springer
14 years 4 months ago
SPARQLeR: Extended Sparql for Semantic Association Discovery
Complex relationships, frequently referred to as semantic associations, are the essence of the Semantic Web. Query and retrieval of semantic associations has been an important task...
Krys Kochut, Maciej Janik