• Aucun résultat trouvé

Pellet System Description

N/A
N/A
Protected

Academic year: 2022

Partager "Pellet System Description"

Copied!
2
0
0

Texte intégral

(1)

Pellet System Description

Evren Sirin and Bijan Parsia

Maryland Information and Network Dynamics Lab, 8400 Baltimore Avenue, College Park, MD, 20740 USA

[email protected], [email protected]

The description logicSHOIN(D)has attracted considerable interest as the foun- dation of the W3C standard Web Ontology Language variant, OWL-DL. Pellet is a sound and complete tableau reasoner forSHOIN(D)and incorporates a number of key features such as conjunctive ABox query, axiom pinpointing, rules,E-connection reasoning, and novel optimizations for nominals. In this paper we summarize Pellet’s features and special capabilities.

Novel Optimizations Pellet implements most of the state of the art optimization techniques provided in the DL literature, e.g. absorption, dependency-directed back- jumping, etc. In addition, there are also many novel optimization techniques im- plemented in Pellet especially to deal with nominals and large ABoxes. See [3] for details about these techniques.

Axiom pinpointing Axiom pinpointing is a non-standard DL inference service that provides a justification for any arbitrary entailment derived by a reasoner from an OWL-DL knowledge base. Given a KB and any of its logical consequences, the axiom pinpointing service determines the premises in the KB that are sufficient for the entailment to hold. The justification is useful for understanding the output of the reasoner, which is key for many tasks, such as ontology debugging, design and evolution. See [2] for more details about axiom pinpointing service in Pellet.

Conjunctive ABox query Query answering is yet another important feature for Se- mantic Web. Pellet includes a query engine that answers conjunctive ABox queries.

In the presence of non-distinguished variables, the well-known “rolling-up” tech- nique is used to answer tree-shaped queries. If there are only distinguished variables then every query atom can be answered in isolation and arbitrary shaped queries can be handled. See [4] for an explanation of the query simplification and query reorder- ing techniques implemented in Pellet.

(2)

E-Connections E-Connections are a framework for combining several families of decidable logics. In [1] we have proposed tableau algorithms for differentE-Connection languages involving Description Logics so that an ontology can be refer to another ontology without fully importing the contents of that ontology. Pellet has been ex- tended with tableau-based decision procedures forE-Connection languages involving combinations ofSHOIN(D)ontologies [1].

Rules Pellet has support forAL-log (Datalog +SHOIN(D)) via a coupling with a Datalog reasoner. It incorporates the traditionalAL-log algorithm and a new pre- compilation technique that is incomplete but more efficient. Pellet also has an exper- imental implementation of a direct tableau algorithm for a DL-safe rules extension to SHOIN(D)[5]. Preliminary empirical results have been encouraging and we think that the DL-safe implementation is practical for small to mid-sized ontologies esp.

when the full expressivity ofSHOIN(D)is needed.

Usability Pellet provides many different interfaces. Pellet has a command line in- terface, an interactive web form, DIG protocol support, and programmatic interface with bindings to Jena and OWL-API libraries. It is used in conjunction with ontology editors Swoop, Protege, and TopBraid Composer.

See the Pellet Web page athttp://www.mindswap.org/2003/pelletfor downloads and more detailed information about the system including the performance evaluation and comparison with other systems.

References

[1] B. Cuenca Grau, B. Parsia, and E.Sirin. Combining OWL ontologies using E- connections. Journal of Web Semantics, 4(1), January 2005.

[2] A. Kalyanpur, B. Parsia, B. Cuenca-Grau, and E. Sirin. Axiom pinpointing: Find- ing (precise) justifications for arbitrary entailments in OWL-DL, 2006. Available at http://www.mindswap.org/papers/TracingTechReport.pdf.

[3] E. Sirin, B. Cuenca-Grau, and B. Parsia. From wine to water: Optimizing de- scription logic reasoning for nominals. In International Conf. on the Principles of Knowledge Representation and Reasoning (KR-2006), 2006.

[4] E. Sirin and B. Parsia. Optimizations for answering conjunctive abox queries:

First results. In Proc. of the Int. Description Logics Workshop (DL 2006), 2006.

[5] B. Parsia V. Kolovski and E. Sirin. Extending the SHOIQ(D) tableaux with dl-safe rules: First results. In Proc. of the Int. Description Logics Workshop (DL 2006), 2006.

Références

Documents relatifs

We would also like to implement a version similar to the approach described by Halland and Britz [4] where the models are computed in an exhaustive run of the tableau reasoner in

Most existing scalable systems for processing conjunctive queries do not take reasoning into account. On the other hand, existing works on scalable reason- ing are limited to

It takes as input the list of deterministic rules and the current tableau and returns a tableau obtained by the application of one rule.. After the application of a deterministic

Our approach involves using a modified Assumption-Based Truth Maintenance Sys- tem (ATMS) [11] to trace inferential dependencies between formulas and compute the minimal sets

It turns out that even for HL already generating the lexicographically first MinA is intractable, thus unless p = np , MinAs cannot be enumerated in a specified lexi- cographic

In contrast to OWL2-EL, the design goal of both OWL2-QL and OWL2-RL is to enable the use of database technology for query answering over OWL in- stance data: many applications

Inspired by traditional lint tools [6, 4], we have developed Pellint, a lint tool that reports and potentially repairs modeling constructs that are known to have bad

Our experi- ments on Snomed ct show that the sets of axioms explaining a given subsumption are usually quite small (78% of the MinAs we computed were of size ten or less), and that