Reasoner
Decidability
- OWL-DL is decidable
- "There are many things systems engineers care about that are beyond the reasoning power of Description Logic. DL reasoners cannot solve differential equations, for example. But a great deal of what we care about, including the structure of systems of differential-algebraic equations can be expressed in assertions about types, properties, and relationships, and OWL reasoning can help us. In these situations we may use a specialized reasoner (e.g., Mathematica) to solve a problem, but a DL-based front end can help us construct the problem efficiently and with confidence in its correctness."
Implementations
Open-Source
- Cwm, a forward-chaining reasoner used for querying, checking, transforming and filtering information. Its core language is RDF, extended to include rules, and it uses RDF/XML or N3 serializations as required.
- Drools, a forward-chaining inference-based rules engine which uses an enhanced implementation of the Rete algorithm.
- also, Swrlapi
- Evrete, a forward-chaining Java rule engine that uses the Rete algorithm and is compliant with the Java Rule Engine API (JSR 94).
- D3web, a platform for knowledge-based systems (expert systems).
- Flora-2, an object-oriented, rule-based knowledge-representation and reasoning system.
- Jena Jena, an open-source semantic-web framework for Java which includes a number of different semantic-reasoning modules.
- NRules a forward-chaining inference-based rules engine implemented in C# which uses an enhanced implementation of the Rete algorithm
- Prova, a semantic-web rule engine which supports data integration via SPARQL queries and type systems (RDFS, OWL ontologies as type system).
- DIP, Defeasible-Inference Platform (DIP) is an Web Ontology Language reasoner and Protégé desktop plugin for representing and reasoning with defeasible subsumption.[3] It implements a Preferential entailment style of reasoning that reduces to "classical entailment" i.e., without the need to modify the underlying decision procedure.
from awesome-ontology
- CEL - A lightweight Description Logic (EL+) reasoner for large-scale biomedical ontologies. (Common Lisp+Java)
- ELK - An ontology reasoner that aims to support the OWL 2 EL profile. (Java)
- EYE - A reasoning engine which performs semibackward chaining and supports Euler paths. (Prolog)
- FaCT++ - The new generation of the well-known FaCT OWL-DL reasoner which uses optimised tableaux algorithms. (C++)
- Flora-2 (Ergo Lite) - A F-logic based reasoning system. (Prolog)
- HyLAR - A rule-based incremental reasoner for the Web. (JavaScript)
- jcel - A reasoner for the description logic EL+. (Java)
- Openllet - An OWL DL reasoner build on top of Pellet 2. (Java)
- OWL-RL - A simple implementation of the OWL2 RL Profile, as well as a basic RDFS inference, on top of RDFLib. (Python)
- pyfactxx - Python bindings for upgraded FaCT reasoner and RDFLib integration. (Python/C++)
- Racer - A knowledge representation system that implements a highly optimized tableau calculus for the description logic SRIQ(D). (Common Lisp+Java)
- Whelk - A Scala OWL reasoner based on the algorithm implemented in ELK, using immutable data structures.
References
- https://www.opencaesar.io/blog/2021/06/19/OML-Origin-and-Rationale.html
- http://owl.cs.manchester.ac.uk/tools/list-of-reasoners/
Backlinks