PreDeLo 1.0: a theorem prover for preferential description logics. We describe PreDeLo 1.0, a theorem prover for preferential Description Logics (DLs). These are nonmonotonic extensions of standard DLs based on a typicality operatorT, which enjoys a preferential semantics. PreDeLo 1.0 is a Prolog implementation of labelled tableaux calculi for such extensions, and it is able to deal with the preferential extension of the basic DL ALC as well as with the preferential extension of the lightweight DL DL − Lite core . The Prolog implementation is inspired by the “lean” methodology, whose basic idea is that each axiom or rule of the tableaux calculi is implemented by a Prolog clause of the program. Concerning ALC, PreDeLo 1.0 considers two extensions based, respectively, on Kraus, Lehmann and Magidor’s preferential and rational entailment. In this paper, we also introduce a tableaux calculus for checking entailment in the rational extension of ALC.
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Giordano, L.; Gliozzi, V.; Olivetti, N.; Pozzato, G.L.: Semantic characterization of rational closure: from propositional logic to description logics (2015)
- Giordano, Laura; Gliozzi, Valentina; Jalal, Adam; Olivetti, Nicola; Pozzato, Gian Luca: Predelo 1.0: a theorem prover for preferential description logics (2013)