Adding Probabilities and Rules to Owl Lite Subsets Based on Probabilistic Datalog

  title={Adding Probabilities and Rules to Owl Lite Subsets Based on Probabilistic Datalog},
  author={Henrik Nottelmann and Norbert Fuhr},
  journal={Int. J. Uncertain. Fuzziness Knowl. Based Syst.},
This paper proposes two probabilistic extensions of variants of the OWL Lite description language, which are essential for advanced applications like information retrieval. The first step follows the axiomatic approach of combining description logics and Horn clauses: Subsets of OWL Lite are mapped in a sound and complete way onto Horn predicate logics (Datalog variants). Compared to earlier approaches, a larger fraction of OWL Lite can be transformed by switching to Datalog with equality in… 

Tractable Reasoning with Bayesian Description Logics

This paper presents a probabilistic generalization of the DL-Litedescription logics, which is based on Bayesian networks, and shows that satisfiability checking and answering unions of conjunctive queries in the new logics can be done in LogSpace in the data complexity.

Expressive probabilistic description logics

Probabilistic Information Integration and Retrieval in the Semantic Web

The Semantic Web (SW) has been envisioned to enable software tools or Web Services, respectively, to process information provided on the Web automatically. For this purpose, languages for

Inference in Probabilistic Ontologies with Attributive Concept Descriptions and Nominals

This paper proposes a probabilistic description logic that combines (i) constructs of the well-known ALC logic, (ii) probabilistic assertions, and (iii) limited use of nominals. We start with our

Probabilistic Description Logics for the Semantic Web Probabilistic Description Logics for the Semantic Web

This paper presents sound and complete algorithms for the main reasoning problems in the new probabilistic description logics, which are based on reductions to reasoning in their classical counterparts, and to solving linear optimization problems, and shows the important result that reasoning in theNew Probabilistic Description logics is decidable / computable.

PR-OWL - a language for defining probabilistic ontologies

Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

We present a novel approach to probabilistic description logic programs for the Semantic Web in which disjunctive logic programs under the answer set semantics are tightly coupled with description

Probabilistic Extensions of Semantic Web Languages - A Survey

This work surveys existing proposals for extending semantic web languages or formalisms underlying Semantic Web languages in terms of their expressive power, reasoning capabilities as well as their suitability for supporting typical tasks associated with the Semantics Web.

Tightly integrated probabilistic description logic programs for representing ontology mappings

This work defines the language, and it is shown that it can be used to resolve inconsistencies and merge mappings from different matchers based on the level of confidence assigned to different rules, and shows that the well-founded semantics approximates the answer set semantics.

URDF: Efficient Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules

Experiments over various benchmark settings confirm a high robustness and significantly improved runtime of the reasoning framework in comparison to state-of-the-art techniques for MCMC sampling such as MAP inference and MC-SAT.



Probabilistic datalog: Implementing logical information retrieval for advanced applications

  • N. Fuhr
  • Computer Science
    J. Am. Soc. Inf. Sci.
  • 2000
This work combines Datalog (function-free Horn clause predicate logic) with probability theory to allow for easy formulation of specific retrieval models for arbitrary applications, and classical probabilistic IR models can be implemented by specifying the appropriate rules.

AL-log: Integrating Datalog and Description Logics

A method for query answering in AL-log based on constrained resolution, where the usual deduction procedure defined for Datalog is integrated with a method for reasoning on the structural knowledge.

Uncertainty and Description Logic Programs : A Proposal for Expressing Rules and Uncertainty on Top of Ontologies

It is shown that μDLPs may be applied in the context of distributed information search in the Semantic Web, where the representation of the inherent uncertainty of the relationships among resource ontologies, to which an automated agent has access to, is required.

Reducing SHIQ-Description Logic to Disjunctive Datalog Programs

This paper presents a novel approach to checking consistency of ABoxes, instance checking and query answering, w.r.t. optimization techniques from deductive databases, and a resolution-based decision procedure for unary coding of numbers worst-case optimal.

P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web

This paper presents a probabilistic extension of SHOQ(D), called P-SHOQ (D), to allow for dealing with Probabilistic ontologies in the semantic web, and presents sound and complete reasoning techniques that show in particular that reasoning in P- SHOZ(D) is decidable.

Description logic programs: combining logic programs with description logic

It is shown how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules and ontologies and define a new intermediate knowledge representation contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL).

Probabilistic Reasoning in Terminological Logics

Practical Reasoning for Expressive Description Logics

An algorithm is presented that decides satisfiability of the DL ACC extended with transitive eind inverse roles, role hierarchies, and quaJifying number restrictions, and early experiments indicate that this algorithm is well-suited for implementation.

P-CLASSIC: A Tractable Probablistic Description Logic

P-CLASSIC is presented, a probabilistic version of the description logiC CLASSIC that combines description logic with Bayesian networks and it is shown that the complexity of the inference algorithm is the best that can be hoped for in a language that combinesdescription logic withBayesian networks.