A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Belief Base Revision for Datalog+/- Ontologies
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
Finally, we give the complexity results by showing that query answering for a revised linear Datalog+/-ontology is tractable. ...
In this paper, we propose an approach to performing belief base revision for Datalog+/-ontologies. ...
This extension uses Markov logic networks as the underlying probabilistic semantics and focus especially on scalable algorithms for answering threshold queries. Riguzzi et al. ...
doi:10.1007/978-3-319-14122-0_14
fatcat:bt6q5frxyvhsjpfh3uamx2y6qy
Belief Base Revision for Datalog+/- Ontologies
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, we give the complexity results by showing that query answering for a revised linear Datalog+/-ontology is tractable. ...
In this paper, we propose an approach to performing belief base revision for Datalog+/-ontologies. ...
This extension uses Markov logic networks as the underlying probabilistic semantics and focus especially on scalable algorithms for answering threshold queries. Riguzzi et al. ...
doi:10.1007/978-3-319-06826-8_14
fatcat:ayqivf5zwfbnncbnudyj4ocjsi
Ontology-Mediated Queries for Probabilistic Databases
2017
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we extend OpenPDBs by Datalog+/- ontologies, under which both upper and lower probabilities of queries become even more informative, enabling us to distinguish queries that were indistinguishable ...
Probabilistic databases (PDBs) are usually incomplete, e.g., containing only the facts that have been extracted from the Web with high confidence. ...
Most of the recent work on probabilistic query answering using ontologies is based on lightweight ontology languages. ...
doi:10.1609/aaai.v31i1.10680
fatcat:o6f5sgqqvfd7tabooreh5doid4
Ontology-Mediated Query Answering over Log-Linear Probabilistic Data
2019
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Ontology-mediated query answering is a popular paradigm for encoding commonsense knowledge, which can provide more complete answers to user queries. ...
We propose a new data model that integrates the paradigm of ontology-mediated query answering with probabilistic databases, employing a log-linear probability model. ...
query answering over probabilistic data in practice. ...
doi:10.1609/aaai.v33i01.33012711
fatcat:epzrqmxrhbarhnx2pp6wlk65m4
Ontology-Based Query Answering for Probabilistic Temporal Data
2019
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We investigate ontology-based query answering for data that are both temporal and probabilistic, which might occur in contexts such as stream reasoning or situation recognition with uncertain data. ...
We analyse the complexities of evaluating queries in this language in various settings. ...
In ontology-based query answering (OBQA), queries are evaluated with respect to an ontology, which specifies background knowledge about the domain of interest. ...
doi:10.1609/aaai.v33i01.33012903
fatcat:t2yis3dzkfe5nmcwk72okiai5q
Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Yet, for illustrative purposes, we also discuss an instantiation of the framework which aims at description and turns out to be useful in Ontology Refinement. ...
Keywords: Inductive Logic Programming, Hybrid Knowledge Representation and Reasoning Systems, Ontologies, Semantic Web. Note: To appear in Theory and Practice of Logic Programming (TPLP) ...
Furthermore, given any query Q, the success set of Q in B coincides with the answer set of Q in B. This provides an operational means for computing correct answers to queries. ...
arXiv:0711.1814v1
fatcat:whglm5y5kfhgbj43h5y3x3fjhi
Techniques of Ontology and its Usage in Indian Languages - A Review
2015
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It is hereby concluded from the review that in Indian languages usage of ontology is very less because of the challenges to build ontology for minority languages. ...
This paper review has been carried out/done on the usage of different ontology building approaches in natural language processing and their usage on Indian languages. ...
The main focus is on scalable algorithms for answering threshold queries to probabilistic guarded Datalog+/− ontologies. ...
doi:10.5120/19975-1873
fatcat:klt7q4x4qff25mtjvoecrsgtuy
Query Answering in Ontologies under Preference Rankings
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Using this formalism, the answers for a given query to an ontology can be ranked by preference, allowing users to retrieve the most preferred answers only. ...
We present an ontological framework, based on preference rankings, that allows users to express their preferences between the knowledge explicitly available in the ontology. ...
In particular, for ranked ontologies in EL, top-k query answering is in P in the data and KB complexity, and ∆ P 2complete in the ranking and combined complexity. ...
doi:10.24963/ijcai.2017/131
dblp:conf/ijcai/CeylanLPT17
fatcat:j5p5ctqkuzd63ocrxdgoei3ol4
An infrastructure for probabilistic reasoning with web ontologies
2016
Semantic Web Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an infrastructure for probabilistic reasoning with ontologies that is based on our Markov logic engine ROCKIT. ...
These scenarios are ontology matching, and knowledge base verification, with a special focus on temporal reasoning. ...
DISPONTE can answer queries over probabilistic ontologies using binary decision diagrams. The corresponding methods have been implemented in the BUNDLE reasoner [33, 5] . ...
doi:10.3233/sw-160219
fatcat:ar723byi55bjvjafoqh3vq73ey
Rules and Ontologies for the Semantic Web
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ontologies as foreseen in the Semantic Web architecture. ...
In Section 5, first general issues that come up in combining logic-based rules and ontologies are revisited in more detail; after that, three different generic settings for ...
An example for a simple SPARQL select query is The SPARQL query language, as shown above, allows to query RDF data using SPARQL endpoints, which are standardized Web Services that answer SPARQL queries ...
doi:10.1007/978-3-540-85658-0_1
fatcat:x75rrerlzvelbh7vpo6subgzru
Rule-based schema matching for ontology-based mediators
2005
Journal of Applied Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We discuss the use of logic representations for mapping schema elements onto concepts expressed in a simplified ontology for cultural assets. ...
Starting with a logic representation of the ontology, criteria for a rule-based schema matching are exemplified. ...
For our purposes a probabilistic extension of Datalog as introduced in [11] (for which an algebraic semantics was given in [12] ) seems to be most appropriate. ...
doi:10.1016/j.jal.2004.07.021
fatcat:3biwpv2vmnbqjdxzbhcxt7wk6m
Fast rule mining in ontological knowledge bases with AMIE $$+$$ +
2015
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Recent advances in information extraction have led to huge knowledge bases (KBs), which capture knowledge in a machine-readable format. ...
In this paper, we show how this approach can be optimized to mine even larger KBs with more than 12M statements. ...
Algorithm 5 shows how we answer these queries. The algorithm takes as input a selection variable x, a projection atom H := R(X, Y ), remaining atoms B 1 , ...B n , the threshold k, and a KB K. ...
doi:10.1007/s00778-015-0394-1
fatcat:pglv7afuwfdsrnew6kh5s6y4fa
ONTOGRATE: TOWARDS AUTOMATIC INTEGRATION FOR RELATIONAL DATABASES AND THE SEMANTIC WEB THROUGH AN ONTOLOGY-BASED FRAMEWORK
2010
International Journal of Semantic Computing (IJSC)
Preserved Fulltext
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.
The testing results of our implemented OntoGrate system in different domains show that the large amount of data in relational databases can be directly utilized for answering Semantic Web queries rather ...
ontology-based queries using the data from heterogeneous databases. ...
Pan at the University of Aberdeen for helpful discussion on OWL-QL and query answering. ...
doi:10.1142/s1793351x10000961
fatcat:zlslblvsqvcojbz7heonzryohi
Most Probable Explanations for Probabilistic Database Queries
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In particular, probabilistic query evaluation has been investigated intensively as a central inference mechanism. ...
We investigate these problems relative to a variety of query languages, ranging from conjunctive queries to ontology-mediated queries, and provide a detailed complexity analysis. ...
Acknowledgments This work was supported by DFG in the CRC 912 (HAEC), GRK 1907 (RoSI), and the project BA 1122/19-1 (GoAsQ), and by the UK EPSRC grants EP/J008346/1, EP/L012138/1, EP/M025268/1, and by ...
doi:10.24963/ijcai.2017/132
dblp:conf/ijcai/CeylanBL17
fatcat:dztny3h4izdg7hqwinkahg2q6y
Recent Advances in Querying Probabilistic Knowledge Bases
2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
commonsense knowledge (and in parallel giving up the tuple-independence assumption), and (iii) by giving up the closed-domain assumption, while preserving some computational properties of query answering ...
in such formalisms. ...
In [Ceylan et al., 2016b] , the computational complexity of query answering in probabilistic Datalog ± under the possible worlds semantics is investigated. ...
doi:10.24963/ijcai.2018/765
dblp:conf/ijcai/BorgwardtCL18
fatcat:o43b3gn6sbgydncx55ryiqftde
« Previous
Showing results 1 — 15 out of 180 results