Internet Archive Scholar
Filters
























6 Hits in 3.0 sec

A Practical Acyclicity Notion for Query Answering Over Horn- $$\mathcal {SRIQ}$$ Ontologies [chapter]

David Carral, Cristina Feier, Pascal Hitzler
2016 Lecture Notes in Computer Science  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (228.0 kB)
https://web.archive.org/web/20200824174614/https://arxiv.org/pdf/1804.07274v1.pdf

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.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

2018 pre-print arXiv:1804.07274v1 fatcat:koc6s7pumvgmbknppr4w73eary
In this paper, we define a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn-SRIQ TBoxes.  ...  Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm.  ...  Introduction Conjunctive query (CQ) answering over expressive Description Logic (DL) ontologies is a key reasoning task which remains unsolved for many practical purposes.  ... 
doi:10.1007/978-3-319-46523-4_5 fatcat:kgxxkq4wffai7g5kdo755bakty
Multiple Versions
Citation

David Carral, Cristina Feier, Pascal Hitzler. "A Practical Acyclicity Notion for Query Answering Over Horn- $$\mathcal {SRIQ}$$ Ontologies." Lecture Notes in Computer Science (2016) 70-85

Reasoning and Query Answering in Description Logics [chapter]

Magdalena Ortiz, Mantas Šimkus
2012 Lecture Notes in Computer Science  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (771.1 kB)
https://web.archive.org/web/20160610152723/http://www.kr.tuwien.ac.at/staff/ortiz/slidesAMW2013tutorial.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL. The file type is application/pdf.

Query Answer A tuple of individuals a 1 , . . . , a n is called an (certain) answer for q(t 1 , . . . , t n ) over K if in every model I of K there is a match π for q such that π(t i ) = a i I for every  ...  horn , DL-Lite krom ) Queries in DLs The user can pose queries over the vocabulary of the ontology, the system performs reasoning to return all answers • Retrieve antibiotics that can be used to treat  ...  . 09) Idea: Given a KB T , A and a CQ q, obtain a FOL query q and an ABox A such that for every tuple a of constants, a is an answer for q over T , A iff a is an answer for q over A (using the usual DB  ... 
doi:10.1007/978-3-642-33158-9_1 fatcat:fzifcfpzwndgrng6jfjeldipxe
Citation

Magdalena Ortiz, Mantas Šimkus. "Reasoning and Query Answering in Description Logics." Lecture Notes in Computer Science (2012) 1-53

Detecting Chase (Non)Termination for Existential Rules with Disjunctions

David Carral, Irina Dragoste, Markus Krötzsch
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (338.8 kB)
https://web.archive.org/web/20190219212945/http://pdfs.semanticscholar.org/1b32/1f6e3e59a0b1ca4b124699acbce94b8690de.pdf

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.

The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination.  ...  Experiments on real-world ontologies show that our acyclicity notions improve significantly over known criteria.  ...  By combining this with our previous acyclicity notions, we hope to decide the question of chase termination for most practical ontologies.  ... 
doi:10.24963/ijcai.2017/128 dblp:conf/ijcai/CarralDK17 fatcat:42ngbxpmdrfoli4on7m3g4cyjy
Citation

David Carral, Irina Dragoste, Markus Krötzsch. "Detecting Chase (Non)Termination for Existential Rules with Disjunctions." Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (2017) 922-928

Real Time Reasoning in OWL2 for GDPR Compliance [article]

P.A. Bonatti, L. Ioffredo, I. Petrova, L. Sauro, I. R. Siahaan
2020 arXiv   pre-print

Preserved Fulltext

Web Archive Capture PDF (481.8 kB)
https://web.archive.org/web/20200321091425/https://arxiv.org/pdf/2001.05390v1.pdf

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.

Moreover, we show how PL and PLR can be extended to support richer ontologies, by means of import-by-query techniques.  ...  We prove also some negative results, concerning the intractability of unrestricted reasoning in PL, and the limitations posed on ontology import.  ...  in Horn-SRIQ, too).  ... 
arXiv:2001.05390v1 fatcat:igusnjpdcbgglgqkne3mm6r5zu
Open Access
Citation

P.A. Bonatti, L. Ioffredo, I. Petrova, L. Sauro, I. R. Siahaan. "Real Time Reasoning in OWL2 for GDPR Compliance." arXiv (2020)

On the Complexity of Semantic Integration of OWL Ontologies [article]

Yevgeny Kazakov, Denis Ponomaryov
2017 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (564.1 kB)
https://web.archive.org/web/20200905231136/https://arxiv.org/pdf/1705.04719v1.pdf

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 propose a new mechanism for integration of OWL ontologies using semantic import relations.  ...  In this paper, we study the complexity of reasoning over ontologies with semantic import relations and establish a range of tight complexity bounds for various fragments of OWL.  ...  The importing mechanism is simple in that it does not require any significant modification of the underlying reasoning algorithms: in order to answer a query over an ontology with an import declaration  ... 
arXiv:1705.04719v1 fatcat:2zq5vd7yinba3o7somsmoqoot4
Citation

Yevgeny Kazakov, Denis Ponomaryov. "On the Complexity of Semantic Integration of OWL Ontologies." arXiv (2017)

HermiT: An OWL 2 Reasoner

Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, Zhe Wang
2014 Journal of automated reasoning  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (522.0 kB)
https://web.archive.org/web/20170813033624/http://www.cs.ox.ac.uk/people/boris.motik/pubs/ghmsw14HermiT.pdf

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.

HermiT is based on the hypertableau calculus, and it supports a wide range of standard and novel optimisations that improve the performance of reasoning on real-world ontologies.  ...  the OWL 2 standard such as DL-safe rules, SPARQL queries, and description graphs.  ...  This is important since ontologies considered in practice often consist of mostly Horn axioms.  ... 
doi:10.1007/s10817-014-9305-1 fatcat:64hxriwsyndetfktyrqu7diwuq
Citation

Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, Zhe Wang. "HermiT: An OWL 2 Reasoner." Journal of automated reasoning 53.3 (2014) 245-269