Pronto: A Practical Probabilistic Description Logic Reasoner. This paper presents Pronto—the first probabilistic Description Logic (DL) reasoner capable of processing knowledge bases containing about a thousand of probabilistic axioms. We describe in detail the novel probabilistic satisfiability (PSAT) algorithm which lies at the heart of Pronto’s architecture. Its key difference from previously developed (propositional) PSAT algorithms is its interaction with the underlying DL reasoner which, first, enables applying well-known linear programming techniques to non-propositional PSAT and, second, is crucial to scaling with respect the amount of classical (non-probabilistic) knowledge. The latter is the key feature for dealing with probabilistic extensions of existing large ontologies. Finally we present the layered architecture of Pronto and demonstrate the experimental evaluation results on randomly generated instances of non-propositional PSAT.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Schoenfisch, Joerg; Stuckenschmidt, Heiner: Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data (2017)
- Hooker, J.N.: Projection, consistency, and George Boole (2016)
- Finger, Marcelo; De Bona, Glauber: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (2015)