Automated Reasoning in $\mathcal{ALCQ}$ via SMT

Haarslev, Volker; Sebastiani, Roberto; Vescovi, Michele

doi:10.1007/978-3-642-22438-6_22

Cited by 10 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although our saturation has a limited handling of at-least cardinality restrictions by using only one representative node as successor, this easily becomes incomplete if also at-most cardinality restrictions are used in ontologies. As a remedy, one could try to extend the saturation procedure to better handle cardinality restrictions or to combine the tableau algorithm with algebraic methods, where cardinality restrictions are handled as a system of linear (in)equations (Haarslev, Sebastiani, & Vescovi, 2011). Moreover, too much non-determinism, e.g., caused by non-absorbable GCIs, can still cause serious issues for tableau-based systems.…”

Section: Comparison With State-of-the-art Reasonersmentioning

confidence: 99%

Pay-As-You-Go Description Logic Reasoning by Coupling Tableau and Saturation Procedures

Steigmiller

Glimm

2015

jair

View full text Add to dashboard Cite

Nowadays, saturation-based reasoners for the OWL EL profile of the Web Ontology Language are able to handle large ontologies such as SNOMED very efficiently. However, it is currently unclear how saturation-based reasoning procedures can be extended to very expressive Description Logics such as SROIQ--the logical underpinning of the current and second iteration of the Web Ontology Language. Tableau-based procedures, on the other hand, are not limited to specific Description Logic languages or OWL profiles, but even highly optimised tableau-based reasoners might not be efficient enough to handle large ontologies such as SNOMED. In this paper, we present an approach for tightly coupling tableau- and saturation-based procedures that we implement in the OWL DL reasoner Konclude. Our detailed evaluation shows that this combination significantly improves the reasoning performance for a wide range of ontologies.

show abstract

Section: Comparison With State-of-the-art Reasonersmentioning

confidence: 99%

Pay-As-You-Go Description Logic Reasoning by Coupling Tableau and Saturation Procedures

Steigmiller

Glimm

2015

jair

View full text Add to dashboard Cite

show abstract

“…For example, Konclude requires for the classification of the atom-complexproton-2.0 ontology from the TONES repository 35.2 s, whereas Pellet only requires 11.4 s (FaCT++ and HermiT timed out). Especially the integration of algebraic methods, where cardinality restrictions are handled as a system of linear (in)equations [25], could provide significant improvements. Furthermore, for a few ontologies the saturation can hardly gain any useful information and its overhead causes a performance decrease.…”

Section: Classificationmentioning

confidence: 99%

Konclude: System description

Steigmiller

Liebig²,

Glimm

2014

Journal of Web Semantics

View full text Add to dashboard Cite

“…For certain DLs, the approach based on translations of the problem to more basic logical reasoning problems, like the ones based on a translation to propositional clausal forms has shown to be very sucessful [8]. Very recently, the approach based on doing translations to less simple knowledge representation formalisms and then using Sat Modulo Theory (SMT) solvers, has started to receive high interest [6].…”

Section: Introductionmentioning

confidence: 99%

On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers

Alsinet

Barroso

Béjar

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we explain the design and preliminary implementation of a solver for the positive satisfiability problem of concepts in a fuzzy description logic over the infinite-valued product logic. The same solver also works for 1-satisfiability in quasi-witnessed models. The solver works by first performing a direct reduction of the problem to a satisfiability problem of a quantifier free boolean formula with non-linear real arithmetic properties, and secondly solves the resulting formula with an SMT solver. We show that the satisfiability problem for such formulas is still a very challenging problem for even the most advanced SMT solvers, and so it represents an interesting problem for the community working on the theory and practice of SMT solvers. We briefly explain a possible way of improving the performance of the solver by an alternative implementation under development, based on a reduction to a boolean formula but with linear real arithmetic properties.

show abstract

Automated Reasoning in $\mathcal{ALCQ}$ via SMT

Cited by 10 publications

References 12 publications

Pay-As-You-Go Description Logic Reasoning by Coupling Tableau and Saturation Procedures

Pay-As-You-Go Description Logic Reasoning by Coupling Tableau and Saturation Procedures

Konclude: System description

On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers

Contact Info

Product

Resources

About