A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Filters
Towards a Unifying Approach to Representing and Querying Temporal Data in Description Logics
[chapter]
2012
Lecture Notes in Computer Science
After providing a comprehensive overview of the background research and identifying the core requirements, we propose a general mechanism of defining temporal query languages for time-stamped data in DLs ...
The difficulty lies in that a proposed approach should reconcile a number of valuable contributions coming from diverse, yet relevant research lines, such as temporal databases and query answering in DLs ...
Discussion and Outlook The design of the language T QL follows closely the principles of query languages for temporal databases, as outlined in e.g. [18] . ...
doi:10.1007/978-3-642-33203-6_8
fatcat:2np2ygklbfh73awl5gu2ycze44
Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules
2010
Theory and Practice of Logic Programming
Logic has been a common ground where Database and Artificial Intelligence research competed and collaborated with each other for a long time (Abiteboulet al. 1995). ...
Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since. ...
Dahl for her insights on Datalog applications for Natural Language Processing and to B. Motik for his presentation on Datalog-based formalisms in the Semantic-Web community. ...
doi:10.1017/s1471068410000086
fatcat:2zi7w5eejvanpknuncdy6qmw2e
Natural Language Interfaces to Data
2022
Foundations and Trends in Databases
There are two main approaches in the literature for interpreting a user's natural language query. Rule-based systems make use of semantic indices, ontologies, and knowledge ...
Recent advances in natural language understanding and processing have resulted in renewed interest in natural language interfaces to data, which provide an easy mechanism for non-technical users to access ...
As a result, natural language interfaces have been an active area of research for many decades. ...
doi:10.1561/1900000078
fatcat:fcm4gxlghbdejjpdk64pt3l6oa
Declarative PTIME queries for relational databases using quantifier elimination
1999
Journal of Logic and Computation
Although similar results have been proven for xpoint languages and extensions to datalog, the claim is that SHQL has the advantage of being purely declarative, where the negation operator is interpreted ...
In this paper, we consider the problem of expressing and computing queries on relational deductive databases in a purely declarative query language, called SHQL (Semi-Horn Query Language). ...
There are many choices as to such a semantics and these choices in uence not only the natural interpretation of the negation symbol in a query, but the expressiveness of the language. ...
doi:10.1093/logcom/9.5.737
fatcat:3w62z4mbnjfdvjg773m4iefwdu
Improving Data Management using Domain Knowledge
2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
We discuss some of our contributions to OMQA, focusing on (i) expressive languages for OMQA, with emphasis on combining the open- and closed-world assumptions to reason about partially complete data; and ...
The development of tools and techniques for flexible and reliable data management is a long-standing challenge, ever more pressing in today's data-rich world. ...
It has been supported by the Austrian Science Fund (FWF) via the now finished project T515, and the ongoing P30360, P30873, and W1255. ...
doi:10.24963/ijcai.2018/814
dblp:conf/ijcai/Ortiz18
fatcat:mlvcs354sbhz3ku5okazsydwoy
Ontological interpretation of biomedical database content
2017
Journal of Biomedical Semantics
For the evaluation of these four models, we consider (i) database content retrieval, using ontologies as query vocabulary; (ii) information completeness; and, (iii) DL complexity and decidability. ...
HYBR is a hybrid of SUBC and DISP and is more parsimonious regarding expressiveness and query answering complexity. For each of the four models, the four CQs were submitted as DL queries. ...
LJ has written and contributed to the ontological basics of the manuscript, as well as reviewed and commented on content and organization. ...
doi:10.1186/s13326-017-0127-z
pmid:28651575
pmcid:PMC5485580
fatcat:6wn2a2px3rbjfh2yzi6vli5t2i
Ontology Query Answering on Databases
[chapter]
2006
Lecture Notes in Computer Science
Via epistemic operators, integrity constraints are introduced, and used for conveying semantic aspects of OWL that are not covered by Datalog-style rule languages. ...
The effective management, such as storage, inference and query, of these ontologies on databases gains increasing attention. ...
The following proposition helps gain insights into the nature of epistemic models for Σ and Σ. ...
doi:10.1007/11926078_32
fatcat:fq7fotzxlja2hmfiix3hhbr36u
The Semantic Web Languages
[chapter]
2009
Semantic Web Information Management
The Semantic Web is basically an extension of the Web and of the Web-enabling database and Internet technology, and, as a consequence, the Semantic Web methodologies, representation mechanisms and logics ...
This is the motivation for many attempts to, more or less loosely, merge the two worlds like, for instance, the various proposals to use relational technology for storing web data or the use of ontologies ...
To provide a few examples of the meaning of the constructs above, owl:Class can be used to represent a concept, owl:equivalentClass to state that a concept is equivalent to another, owl:Thing to represent ...
doi:10.1007/978-3-642-04329-1_3
fatcat:nzifw26awbcflp4hi75ygv4hw4
Workshop on comparing description and frame logics
1998
Data & Knowledge Engineering
However, every PROLOG programmer uses of knowledge of the inference strategy of the rule interpreter, and some of the language constructs, like the cut , explicitly allow improvement of the efficiency ...
Therefore, specification languages for KBSs. like (ML) 2 and KARL, use a distinct logical language to represent control knowledge. ...
We thank all participants for their productive discussions and the firendly atmosphere they created. ...
doi:10.1016/s0169-023x(97)00039-6
fatcat:37tqhgnbtbfujht33mdrnjr33q
Bridging the gap between OWL and relational databases
2007
Proceedings of the 16th international conference on World Wide Web - WWW '07
We discuss the algorithms for checking IC satisfaction for different types of knowledge bases, and show that, if the constraints are satisfied, we can disregard them while answering a broad range of positive ...
If these statements are meant to be interpreted as integrity constraints (ICs), OWL's interpretation may seem confusing and/or inappropriate. ...
The open-world semantics is natural for a schema language since a schema selects the legal database instances. ...
doi:10.1145/1242572.1242681
dblp:conf/www/MotikHS07
fatcat:s2joyrpis5ezvorm23kgck66xy
Bridging the gap between OWL and relational databases
2009
Journal of Web Semantics
We discuss the algorithms for checking IC satisfaction for different types of knowledge bases, and show that, if the constraints are satisfied, we can disregard them while answering a broad range of positive ...
If these statements are meant to be interpreted as integrity constraints (ICs), OWL's interpretation may seem confusing and/or inappropriate. ...
The open-world semantics is natural for a schema language since a schema selects the legal database instances. ...
doi:10.1016/j.websem.2009.02.001
fatcat:om3h2lz7kneaxazuapblg7ru5q
VISIONARY: a Viewpoint-based Visual Language for Querying Relational Databases
1999
Journal of Visual Languages and Computing
In this work we propose a visual query language based on a diagrammatic paradigm, used for both data and query representation. ...
The external data model is called vision and is made up of the visual primitives of concept and association. ...
An example of potential link in the Order Database is the one defined by the directed links dl 1 and dl 2 such that: rel(dl 1 ) = ORDER, attr(dl 1 ) = expressedIn, multi(dl 1 ) = 1, rel(dl 2 ) = CURRENCY ...
doi:10.1006/jvlc.1998.0102
fatcat:mludijt2trduvadgdwrtmxyu5a
Querying Rich Ontologies by Exploiting the Structure of Data
2020
Künstliche Intelligenz
However, there exists a disparity in research carried for OMQ algorithms for lightweight DLs which have found their way into practical implementations, and algorithms for expressive DLs for which the work ...
In this paper, a brief summary of the technique along with the different algorithms developed for OMQ for expressive DLs is given. ...
To view a copy of this licence, visit http://creat iveco mmons .org/licen ses/by/4.0/. ...
doi:10.1007/s13218-020-00672-9
dblp:journals/ki/Bajraktari20
fatcat:jnntlocoojaenm4xxk4ym7w74u
Resolving Ambiguities in the Semantic Interpretation of Natural Language Questions
[chapter]
2006
Lecture Notes in Computer Science
However, natural language is not a formal language and thus can cause ambiguities in the interpretation of the sentence. ...
The user can formulate a complete question in natural language and submit it to the semantic search engine. ...
Related Work In this section, we present some related work from the fields of "Natural Language Interfaces to Databases" and "Question-Answering Systems". ...
doi:10.1007/11875581_74
fatcat:jadz4duhufcftjz3yeoek7cpvi
Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
[chapter]
2011
Lecture Notes in Computer Science
In particular, we consider temporal extensions of DL-Lite N bool , which was shown to be adequate for capturing non-temporal conceptual models without relationship inclusion, and its fragment DL-Lite N ...
Both the Extended Entity-Relationship (EER) model and the Unified Modelling Language (UML) have been temporally extended to design temporal databases. ...
An interpretation I = (∆ I , · I ) of this and other DL-Lite languages consists of a domain ∆ I = ∅ and an interpretation function · I that assigns to each object name a i an element a I i ∈ ∆ I , to each ...
doi:10.1007/978-3-642-24364-6_1
fatcat:sgxj37qxijdg3hxwd6dgtby3fi
« Previous
Showing results 1 — 15 out of 19,185 results