scholarly journals Limiting Until in Ordered Tree Query Languages

2016 ◽  
Vol 17 (2) ◽  
pp. 1-34
Author(s):  
Michael Benedikt ◽  
Clemens Ley
Keyword(s):  
Query Languages ◽  
Ordered Tree

Classification of means and methods of the Web semantic retrieval

2017 ◽  
pp. 030-050
Author(s):  
J.V. Rogushina ◽  
Keyword(s):  
Search Engines ◽  
Domain Knowledge ◽  
Information Needs ◽  
Web Search ◽  
User Interaction ◽  
Query Languages ◽  
Semantic Search ◽  
Semantic Retrieval ◽  
The Web

Problems associated with the improve ment of information retrieval for open environment are considered and the need for it’s semantization is grounded. Thecurrent state and prospects of development of semantic search engines that are focused on the Web information resources processing are analysed, the criteria for the classification of such systems are reviewed. In this analysis the significant attention is paid to the semantic search use of ontologies that contain knowledge about the subject area and the search users. The sources of ontological knowledge and methods of their processing for the improvement of the search procedures are considered. Examples of semantic search systems that use structured query languages (eg, SPARQL), lists of keywords and queries in natural language are proposed. Such criteria for the classification of semantic search engines like architecture, coupling, transparency, user context, modification requests, ontology structure, etc. are considered. Different ways of support of semantic and otology based modification of user queries that improve the completeness and accuracy of the search are analyzed. On base of analysis of the properties of existing semantic search engines in terms of these criteria, the areas for further improvement of these systems are selected: the development of metasearch systems, semantic modification of user requests, the determination of an user-acceptable transparency level of the search procedures, flexibility of domain knowledge management tools, increasing productivity and scalability. In addition, the development of means of semantic Web search needs in use of some external knowledge base which contains knowledge about the domain of user information needs, and in providing the users with the ability to independent selection of knowledge that is used in the search process. There is necessary to take into account the history of user interaction with the retrieval system and the search context for personalization of the query results and their ordering in accordance with the user information needs. All these aspects were taken into account in the design and implementation of semantic search engine "MAIPS" that is based on an ontological model of users and resources cooperation into the Web.

Temporalizing Rewritable Query Languages Over Knowledge Bases

2015 ◽  
Author(s):  
Stefan Borgwardt ◽  
Marcel Lippmann ◽  
Veronika Thost
Keyword(s):  
Knowledge Bases ◽  
Query Languages

scholarly journals Local properties of query languages

2000 ◽  
Vol 239 (2) ◽  
pp. 277-308 ◽  
Author(s):  
Guozhu Dong ◽  
Leonid Libkin ◽  
Limsoon Wong
Keyword(s):  
Query Languages ◽  
Local Properties

scholarly journals Event order generation using Reference Event based qualitative Temporal (REseT) relations in Time Event Ontology

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
V. Uma ◽  
G. Aghila
Keyword(s):  
Query Languages ◽  
Vital Role ◽  
Knowledge Representation And Reasoning ◽  
Interval Algebra ◽  
Event Ordering ◽  
Ontology Language ◽  
Reference Event ◽  
Event Order ◽  
Event Based ◽  
Temporal Ordering

AbstractOWL (Web Ontology Language) is the standard language for Semantic Web and is used in defining ontologies for Web. Temporal event data are ubiquitous in nature. Temporal data can be represented qualitatively using temporal relations in OWL, enabling temporal ordering of events which plays a vital role in task planners. The basic Allen’s temporal interval relations can be used to describe relations in OWL. Allen’s interval algebra is a well known formalism used to represent and reason the temporal knowledge. In this work, Allen’s interval algebra is extended by Reference Event based Temporal (REseT) relations to reduce the ambiguity in the before relation. The extended formalism is used in the representation of relations between time intervals and the viability of ordering of events in ontology is elucidated. This paper proposes a temporal knowledge representation and reasoning based event ordering system which helps in the temporal ordering of events. The advantage of this method is that it does not introduce any additional constructs in OWL and hence the existing reasoning tools and DL based query languages are capable of generating the linear order of events. The system is investigated experimentally using the COW (Correlates of War) dataset and has been evaluated using the Percent_ Similarity measure.

Sign in / Sign up

Export Citation Format

Share Document