Semantic reasoner explained

A semantic reasoner, reasoning engine, rules engine, or simply a reasoner, is a piece of software able to infer logical consequences from a set of asserted facts or axioms. The notion of a semantic reasoner generalizes that of an inference engine, by providing a richer set of mechanisms to work with. The inference rules are commonly specified by means of an ontology language, and often a description logic language. Many reasoners use first-order predicate logic to perform reasoning; inference commonly proceeds by forward chaining and backward chaining. There are also examples of probabilistic reasoners, including non-axiomatic reasoning systems,[1] and probabilistic logic networks.[2]

Notable applications

Notable semantic reasoners and related software:

Free to use (closed source)

Free software (open source)

Semantic Reasoner for Internet of Things (open-source)

S-LOR (Sensor-based Linked Open Rules) semantic reasonerS-LOR is under GNU GPLv3 license.

S-LOR (Sensor-based Linked Open Rules) is a rule-based reasoning engine and an approach for sharing and reusing interoperable rules to deduce meaningful knowledge from sensor measurements.

See also

External links

Notes and References

  1. Web site: Wang . Pei . Grounded on Experience Semantics for intelligence, Tech report 96 . www.cogsci.indiana.edu . CRCC . 13 April 2015.
  2. Book: Goertzel . Ben . Iklé . Matthew . Goertzel . Izabela Freire . Heljakka . Ari . Probabilistic Logic Networks: A Comprehensive Framework for Uncertain Inference . 2008 . Springer Science & Business Media . 978-0-387-76872-4 . 42.
  3. Britz, K. and Varzinczak, I., (2018). Rationality and context in defeasible subsumption. In International Symposium on Foundations of Information and Knowledge Systems (pp. 114-132). Springer, Cham.