Hypertableau reasoning for description logics

B Motik, R Shearer, I Horrocks - Journal of Artificial Intelligence Research, 2009 - jair.org
We present a novel reasoning calculus for the description logic SHOIQ^+---a knowledge
representation formalism with applications in areas such as the Semantic Web …

Optimized reasoning in description logics using hypertableaux

B Motik, R Shearer, I Horrocks - … Deduction Bremen, Germany, July 17-20 …, 2007 - Springer
We present a novel reasoning calculus for Description Logics (DLs)—knowledge
representation formalisms with applications in areas such as the Semantic Web. In order to …

[PDF][PDF] Effective query rewriting with ontologies over DBoxes

I Seylan, E Franconi, J De Bruijn - IJCAI, 2009 - inf.unibz.it
We consider query answering on Description Logic (DL) ontologies with DBoxes, where a
DBox is a set of assertions on individuals involving atomic concepts and roles called DBox …

Beth definability in expressive description logics

B Ten Cate, E Franconi, I Seylan - Journal of Artificial Intelligence Research, 2013 - jair.org
The Beth definability property, a well-known property from classical logic, is investigated in
the context of description logics: if a general L-TBox implicitly defines an L-concept in terms …

Spartacus: A tableau prover for hybrid logic

D Götzmann, M Kaminski, G Smolka - Electronic Notes in Theoretical …, 2010 - Elsevier
Spartacus is a tableau prover for hybrid multimodal logic with global modalities and reflexive
and transitive relations. Spartacus is the first system to use pattern-based blocking for …

On the scalability of description logic instance retrieval

V Haarslev, R Möller - Journal of Automated Reasoning, 2008 - Springer
Practical description logic systems play an ever-growing role for knowledge representation
and reasoning research even in distributed environments. In particular, the ontology layer of …

[HTML][HTML] Consequence-based and fixed-parameter tractable reasoning in description logics

F Simančík, B Motik, I Horrocks - Artificial Intelligence, 2014 - Elsevier
In this paper we investigate the consequence-based algorithms that are nowadays
commonly used for subsumption reasoning with description logic ontologies, presenting the …

[PDF][PDF] Extending consequence-based reasoning to SRIQ

A Bate, B Motik, BC Grau, F Simančík… - … Conference on the …, 2016 - cdn.aaai.org
Consequence-based calculi are a family of reasoning algorithms for description logics
(DLs), and they combine hypertableau and resolution in a way that often achieves excellent …

ExpTime tableaux for using sound global caching

R Goré, LA Nguyen - Journal of Automated Reasoning, 2013 - Springer
We present a simple E xp T ime (complexity-optimal) tableau decision procedure based on
and-or graphs with sound global caching for checking satisfiability of a concept wrt a TBox in …

Consequence-based reasoning for description logics with disjunctions and number restrictions

A Bate, B Motik, BC Grau, DT Cucala, F Simančík… - Journal of Artificial …, 2018 - jair.org
Classification of description logic (DL) ontologies is a key computational problem in modern
data management applications, so considerable effort has been devoted to the development …