Description logic

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Description logic (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first-order predicate logic.

DL is used in artificial intelligence for formal reasoning on the concepts of an application domain (known as terminological knowledge). It is of particular importance in providing a logical formalism for ontologies and the Semantic Web. The most notable application outside information science is in biomedical informatics where DL assists in the codification of medical knowledge.

Introduction[edit]

A Description Logic (DL) models concepts, roles and individuals, and their relationships.

The fundamental modeling concept of a DL is the axiom - a logical statement relating roles and/or concepts.[1] This is a key difference from the frames paradigm where a frame specification declares and completely defines a class.[1]

Nomenclature[edit]

Differences from First-Order Logic[edit]

The description logic community uses different terminology than the first-order predicate logic community for operationally-equivalent notions; some examples are given here:

Synonyms
FOL DL
class concept
property or predicate role
object individual

The Web Ontology Language [OWL] mostly uses FOL terminology, in spite of being an implementation of a description logic.

Naming convention[edit]

There are many varieties of Description Logic and there is an informal naming convention, roughly describing the operators allowed. The expressivity is encoded in the label for a logic starting with one of the following basic logics:

\mathcal{AL} Attributive language. This is the base language which allows:
  • Atomic negation (negation of concept names that do not appear on the left hand side of axioms)
  • Concept intersection
  • Universal restrictions
  • Limited existential quantification
\mathcal{FL} Frame based description language,[2] allows:
  • Concept intersection
  • Universal restrictions
  • Limited existential quantification
  • Role restriction
\mathcal{EL} Allows:
  • Concept intersection
  • Existential restrictions (of full existential quantification)

Followed by any of the following extensions:

\mathcal{F} Functional properties, a special case of uniqueness quantification.
\mathcal{E} Full existential qualification (Existential restrictions that have fillers other than \top).
\mathcal{U} Concept union.
\mathcal{C} Complex concept negation.
\mathcal{H} Role hierarchy (subproperties - rdfs:subPropertyOf).
\mathcal{R} Limited complex role inclusion axioms; reflexivity and irreflexivity; role disjointness.
\mathcal{O} Nominals. (Enumerated classes of object value restrictions - owl:oneOf, owl:hasValue).
\mathcal{I} Inverse properties.
\mathcal{N} Cardinality restrictions (owl:cardinality, owl:maxCardinality), a special case of counting quantification
\mathcal{Q} Qualified cardinality restrictions (available in OWL 2, cardinality restrictions that have fillers other than \top).
^\mathcal{(D)} Use of datatype properties, data values or data types.

Exceptions[edit]

Some canonical DLs that do not exactly fit this convention are:

\mathcal{S} An abbreviation for \mathcal{ALC} with transitive roles.
\mathcal{FL^-} A sub-language of \mathcal{FL}, which is obtained by disallowing role restriction. This is equivalent to \mathcal{AL} without atomic negation.
\mathcal{FL}_o A sub-language of \mathcal{FL^-}, which is obtained by disallowing limited existential quantification.
\mathcal{EL^{++}} Alias for \mathcal{ELRO}.[3]

Examples[edit]

As an example, \mathcal{ALC} is a centrally important description logic from which comparisons with other varieties can be made. \mathcal{ALC} is simply \mathcal{AL} with complement of any concept allowed, not just atomic concepts.

A further example, the description logic \mathcal{SHIQ} is the logic \mathcal{ALC} plus extended cardinality restrictions, and transitive and inverse roles. The naming conventions aren't purely systematic so that the logic \mathcal{ALCOIN} might be referred to as \mathcal{ALCNIO} and abbreviations are made where possible, \mathcal{ALC} is used instead of the equivalent \mathcal{ALUE}.

The Protégé ontology editor supports \mathcal{SHOIN}^\mathcal{(D)}. Three major biomedical informatics terminology bases, SNOMED CT, GALEN, and GO, are expressible in \mathcal{EL} (with additional role properties).

OWL 2 provides the expressiveness of \mathcal{SROIQ}^\mathcal{(D)}, OWL-DL is based on \mathcal{SHOIN}^\mathcal{(D)}, and for OWL-Lite it is \mathcal{SHIF}^\mathcal{(D)}.

History[edit]

Description logic (DL) was given its current name in the 1980s. Previous to this it was called (chronologically): terminological systems, and concept languages.

Knowledge representation[edit]

Frames and semantic networks lack formal (logic-based) semantics.[4] DL was first introduced into Knowledge Representation (KR) systems to overcome this deficiency.[4]

The first DL-based KR system was KL-ONE (by Ronald J. Brachman and Schmolze, 1985). During the '80s other DL-based systems using structural subsumption algorithms[4] were developed including KRYPTON (1983), LOOM (1987), BACK (1988), K-REP (1991) and CLASSIC (1991). This approach featured DL with limited expressiveness but relatively efficient (polynomial time) reasoning.[4]

In the early '90s, the introduction of a new tableau based algorithm paradigm allowed efficient reasoning on more expressive DL.[4] DL-based systems using these algorithms - such as KRIS (1991) - show acceptable reasoning performance on typical inference problems even though the worst case complexity is no longer polynomial.[4]

From the mid '90s, reasoners were created with good practical performance on very expressive DL with high worst case complexity.[4] Examples from this period include FaCT,[5] RACER (2001), CEL (2005), and KAON 2 (2005).

DL reasoners, such as FaCT, FaCT++,[5] RACER, DLP and Pellet,[6] implement the analytic tableau method. KAON2 is implemented by algorithms which reduce a SHIQ(D) knowledge base to a disjunctive datalog program.

Semantic Web[edit]

The DARPA Agent Markup Language (DAML) and Ontology Inference Layer (OIL) ontology languages for the semantic web can be viewed as syntactic variants of DL.[7] In particular, the formal semantics and reasoning in OIL use the \mathcal{SHIQ} DL.[8] The DAML+OIL DL was developed as a submission to[9] - and formed the starting point of - the World Wide Web Consortium (W3C) Web Ontology Working Group.[10] In 2004, the Web Ontology Working Group completed its work by issuing the OWL[11] recommendation. The design of OWL is based on the \mathcal{SH} family of DL[12] with OWL DL and OWL Lite based on \mathcal{SHOIN}^\mathcal{(D)} and \mathcal{SHIF}^\mathcal{(D)} respectively.[12]

The W3C OWL Working Group began work in 2007 on a refinement of - and extension to - OWL.[13] In 2009, this was completed by the issuance of the OWL2 recommendation.[14] OWL2 is based on the description logic \mathcal{SROIQ}^\mathcal{(D)}.[15] Practical experience demonstrated that OWL DL lacked several key features necessary to model complex domains.[1]

Modeling[edit]

In DL, a distinction is drawn between the so-called TBox (terminological box) and the ABox (assertional box). In general, the TBox contains sentences describing concept hierarchies (i.e., relations between concepts) while the ABox contains ground sentences stating where in the hierarchy individuals belong (i.e., relations between individuals and concepts). For example, the statement:

(1) Every employee is a person

belongs in the TBox, while the statement:

(2) Bob is an employee

belongs in the ABox.

Note that the TBox/ABox distinction is not significant, in the same sense that the two "kinds" of sentences are not treated differently in first-order logic (which subsumes most DL). When translated into first-order logic, a subsumption axiom like (1) is simply a conditional restriction to unary predicates (concepts) with only variables appearing in it. Clearly, a sentence of this form is not privileged or special over sentences in which only constants ("grounded" values) appear like (2).

So why was the distinction introduced? The primary reason is that the separation can be useful when describing and formulating decision-procedures for various DL. For example, a reasoner might process the TBox and ABox separately, in part because certain key inference problems are tied to one but not the other one ('classification' is related to the TBox, 'instance checking' to the ABox). Another example is that the complexity of the TBox can greatly affect the performance of a given decision-procedure for a certain DL, independently of the ABox. Thus, it is useful to have a way to talk about that specific part of the knowledge base.

The secondary reason is that the distinction can make sense from the knowledge base modeler's perspective. It is plausible to distinguish between our conception of terms/concepts in the world (class axioms in the TBox) and particular manifestations of those terms/concepts (instance assertions in the ABox). In the above example: when the hierarchy within a company is the same in every branch but the assignment to employees is different in every department (because there are other people working there), it makes sense to reuse the TBox for different branches that do not use the same ABox.

There are two features of Description Logic that are not shared by most other data description formalisms: DL does not make the Unique Name Assumption (UNA) or the Closed World Assumption (CWA). Not having UNA means that two concepts with different names may be allowed by some inference to be shown to be equivalent. Not having CWA, or rather having the Open World Assumption (OWA) means that lack of knowledge of a fact does not immediately imply knowledge of the negation of a fact.

Formal description[edit]

Like first order logic (FOL), a syntax defines which collections of symbols are legal expressions in a Description Logic (DL), and semantics determine meaning. Unlike FOL, a DL may have several well known syntactic variants.[7]

Syntax[edit]

The syntax of a member of the description logic family is characterized by its recursive definition, in which the constructors that can be used to form concept terms are stated. Some constructors are related to logical constructors in first-order logic (FOL) such as intersection or conjunction of concepts, union or disjunction of concepts, negation or complement of concepts, universal restriction and existential restriction. Other constructors have no corresponding construction in FOL including restrictions on roles for example, inverse, transitivity and functionality.

Notation[edit]

Let C and D be concepts, a and b be individuals, and R be a role.

Conventional Notation
Symbol Description Example Read
\top ⊤ is a special concept with every individual as an instance \top top
\bot empty concept \bot bottom
\sqcap intersection or conjunction of concepts C \sqcap D C and D
\sqcup union or disjunction of concepts C \sqcup D C or D
\neg negation or complement of concepts \neg C not C
\forall universal restriction \forall R.C all R-successors are in C
\exists existential restriction \exists R.C an R-successor exists in C
\sqsubseteq Concept inclusion C \sqsubseteq D all C are D
\equiv Concept equivalence C \equiv D C is equivalent to D
\dot = Concept definition C \dot = D C is defined to be equal to D
 : Concept assertion a : C a is a C
 : Role assertion (a,b) : R a is R-related to b

The description logic ALC[edit]

The prototypical DL Attributive Concept Language with Complements (\mathcal{ALC}) was introduced by Manfred Schmidt-Schauß and Gert Smolka in 1991, and is the basis of many more expressive DL.[4] The following definitions follow the treatment in Baader et al.[4]

Let N_C, N_R and N_O be (respectively) sets of concept names (also known as atomic concepts), role names and individual names (also known as individuals, nominals or objects). Then the ordered triple (N_C, N_R, N_O ) is the signature.

Concepts[edit]

The set of \mathcal{ALC} concepts is the smallest set such that:

  • The following are concepts:
    • \top (top is a concept)
    • \bot (bottom is a concept)
    • Every A \in N_C (all atomic concepts are concepts)
  • If C and D are concepts and R \in N_R then the following are concepts:
    • C\sqcap D (the intersection of two concepts is a concept)
    • C\sqcup D (the union of two concepts is a concept)
    • \neg C (the complement of a concept is a concept)
    • \forall R.C (the universal restriction of a concept by a role is a concept)
    • \exists R.C (the existential restriction of a concept by a role is a concept)
Terminological axioms[edit]

A general concept inclusion (GCI) has the form C \sqsubseteq D where C and D are concepts. Write C \equiv D when C \sqsubseteq D and D \sqsubseteq C. A TBox is any finite set of GCIs.

Assertional axioms[edit]
  • A concept assertion is a statement of the form a : C where a \in N_O and C is a concept.
  • A role assertion is a statement of the form (a,b) : R where a, b \in N_O and R is a role.

An ABox is a finite set of assertional axioms.

Knowledge base[edit]

A knowledge base (KB) is an ordered pair (\mathcal{T}, \mathcal{A}) for TBox \mathcal{T} and ABox \mathcal{A}.

Semantics[edit]

The semantics of description logic are defined by interpreting concepts as sets of individuals and roles as sets of ordered pairs of individuals. Those individuals are typically assumed from a given domain. The semantics of non-atomic concepts and roles is then defined in terms of atomic concepts and roles. This is done by using a recursive definition similar to the syntax.

The description logic ALC[edit]

The following definitions follow the treatment in Baader et al.[4]

A terminological interpretation \mathcal{I}=(\Delta^{\mathcal{I}}, \cdot^{\mathcal{I}}) over a signature (N_C,N_R,N_O) consists of

  • a non-empty set \Delta^{\mathcal{I}} called the domain
  • a interpretation function \cdot^{\mathcal{I}} that maps:
    • every individual a to an element a^{\mathcal{I}} \in \Delta^{\mathcal{I}}
    • every concept to a subset of \Delta^{\mathcal{I}}
    • every role name to a subset of \Delta^{\mathcal{I}}  \times \Delta^{\mathcal{I}}

such that

Define \mathcal{I} \models (read I models) as follows

TBox[edit]
  • \mathcal{I} \models C \sqsubseteq D if and only if C^{\mathcal{I}} \subseteq D^{\mathcal{I}}
  • \mathcal{I} \models \mathcal{T} if and only if \mathcal{I} \models \Phi for every \Phi \in \mathcal{T}
ABox[edit]
  • \mathcal{I} \models a : C if and only if a^{\mathcal{I}} \in C^{\mathcal{I}}
  • \mathcal{I} \models (a,b) : R if and only if (a^{\mathcal{I}},b^{\mathcal{I}}) \in R^{\mathcal{I}}
  • \mathcal{I} \models \mathcal{A} if and only if \mathcal{I} \models \phi for every \phi \in \mathcal{A}
Knowledge base[edit]

Let \mathcal{K} = (\mathcal{T}, \mathcal{A}) be a knowledge base.

  • \mathcal{I} \models \mathcal{K} if and only if \mathcal{I} \models \mathcal{T} and \mathcal{I} \models \mathcal{A}

Inference[edit]

Decision problems[edit]

In addition to the ability to describe concepts formally, one also would like to employ the description of a set of concepts to ask questions about the concepts and instances described. The most common decision problems are basic database-query-like questions like instance checking (is a particular instance (member of an A-box) a member of a given concept) and relation checking (does a relation/role hold between two instances, in other words does a have property b), and the more global-database-questions like subsumption (is a concept a subset of another concept), and concept consistency (is there no contradiction among the definitions or chain of definitions). The more operators one includes in a logic and the more complicated the T-box (having cycles, allowing non-atomic concepts to include each other), usually the higher the computational complexity is for each of these problems (see Navigator on Description Logic Complexity for examples).

Relationship with other logics[edit]

First order logic[edit]

Many Description Logic models (DLs) are decidable fragments of first order logic (FOL).[4] and are usually fragments of two-variable logic. Some DLs now include operations (for example, transitive closure of roles) that allow efficient inference but cannot be expressed in FOL.[4]

Fuzzy description logic[edit]

Fuzzy description logic combines fuzzy logic with DLs. Since many concepts that are needed for intelligent systems lack well defined boundaries, or precisely defined criteria of membership, fuzzy logic is needed to deal with notions of vagueness and imprecision. This offers a motivation for a generalization of description logic towards dealing with imprecise and vague concepts.

Modal logic[edit]

Description Logic is related to — but developed independently of — modal logic (ML).[4] Many — but not all — DL are syntactic variants of ML.[4]

In general, an object corresponds to a possible world, a concept corresponds to a modal proposition, and a role-bounded quantifier to a modal operator with that role as its accessibility relation.

Operations on roles (such as composition, inversion, etc.) correspond to the modal operations used in dynamic logic.[16][16]

Examples[edit]

Syntactic Variants
DL ML
\mathcal{ALC} K[4]
\mathcal{SR} PDL[16]
\mathcal{FSR} DPDL (deterministic PDL)[16]
\mathcal{TSL}, or \mathcal{SRI} Converse-PDL[16]
\mathcal{FSL}, or \mathcal{FSRI} Converse-DPDL (deterministic PDL)[16]

Temporal description logic[edit]

Temporal description logic represents — and allows reasoning about — time dependent concepts and many different approaches to this problem exist.[17] For example, a description logic might be combined with a modal temporal logic such as Linear temporal logic.

See also[edit]

Notes[edit]

  1. ^ a b c Grau, B. C.; Horrocks, I.; Motik, B.; Parsia, B.; Patel-Schneider, P. F.; Sattler, U. (2008). "OWL 2: The next step for OWL". Web Semantics: Science, Services and Agents on the World Wide Web 6 (4): 309–322. doi:10.1016/j.websem.2008.05.001.  edit
  2. ^ Levesque, Hector J.; Brachmann, Ronald J. (1987). "Expressiveness and tractability in knowledge representation and reasoning". Computational Intelligence (3). 
  3. ^ Maier, Frederick; Mutharaju, Raghava; Hitzler, Pascal (2010). "Distributed Reasoning with EL++ Using MapReduce". Technical Report, Kno.e.sis Center, Wright State University, Dayton, Ohio. Retrieved 2011-12-25. 
  4. ^ a b c d e f g h i j k l m n o Franz Baader, Ian Horrocks, and Ulrike Sattler Chapter 3 Description Logics. In Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors, Handbook of Knowledge Representation. Elsevier, 2007.
  5. ^ a b Tsarkov, D.; Horrocks, I. (2006). "FaCT++ Description Logic Reasoner: System Description". Automated Reasoning. Lecture Notes in Computer Science 4130. pp. 292–297. doi:10.1007/11814771_26. ISBN 978-3-540-37187-8.  edit
  6. ^ Sirin, E.; Parsia, B.; Grau, B. C.; Kalyanpur, A.; Katz, Y. (2007). "Pellet: A practical OWL-DL reasoner". Web Semantics: Science, Services and Agents on the World Wide Web 5 (2): 51–53. doi:10.1016/j.websem.2007.03.004.  edit
  7. ^ a b Ian Horrocks and Ulrike Sattler Ontology Reasoning in the SHOQ(D) Description Logic, in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001.
  8. ^ Fensel, D.; Van Harmelen, F.; Horrocks, I.; McGuinness, D. L.; Patel-Schneider, P. F. (2001). "OIL: An ontology infrastructure for the Semantic Web". IEEE Intelligent Systems 16 (2): 38–45. doi:10.1109/5254.920598.  edit
  9. ^ Ian Horrocks and Peter F. Patel-Schneider The Generation of DAML+OIL. In Proceedings of the 2001 Description Logic Workshop (DL 2001), volume 49 of CEUR <http://ceur-ws.org/>, pages 30–35, 2001.
  10. ^ Web Ontology Working Group Charter, 2003
  11. ^ W3C Press Release, 2004
  12. ^ a b Horrocks, I.; Patel-Schneider, Peter; van Harmelen, Frank (2003). "From SHIQ and RDF to OWL: The making of a Web Ontology Language". Web Semantics: Science, Services and Agents on the World Wide Web 1: 7–26. doi:10.1016/j.websem.2003.07.001.  edit
  13. ^ OWL Working Group Charter, 2007
  14. ^ Hitzler, Pascal; Krötzsch, Markus; Parsia, Bijan; Patel-Schneider, Peter F.; Rudolph, Sebastian (27 October 2009). "OWL 2 Web Ontology Language Primer". OWL 2 Web Ontology Language. World Wide Wed Consortium. Retrieved 2010-12-14. 
  15. ^ Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph (August 25, 2009). Foundations of Semantic Web Technologies. CRCPress. ISBN 1-4200-9050-X. 
  16. ^ a b c d e f Schild, Klaus. "Correspondence theory for terminological logics: Preliminary Report". KIT Report 91. KIT-BACK. Retrieved 2012-10-25. 
  17. ^ Alessandro Artale and Enrico Franconi "Temporal Description Logics". In "Handbook of Temporal Reasoning in Artificial Intelligence", 2005.

References[edit]

Further reading[edit]

External links[edit]

Tools[edit]

Reasoners

There are some reasoners that deal with OWL and Description Logic. These are some of the most popular:

  • CEL is a free (for non-commercial use) LISP-based reasoner
  • Cerebra Engine was a commercial C++-based reasoner, acquired in 2006 by webMethods.
  • FaCT++ is a free open-source C++-based reasoner.
  • KAON2 is a free (free for non-commercial usage) Java reasoner.
  • MSPASS is a free open-source C reasoner for numerous description logic models.
  • Pellet is a dual-licensed (AGPL and proprietary) commercial, Java-based reasoner.
  • RacerPro of Racer Systems is a commercial (free trials and research licenses are available) lisp-based reasoner.
  • Sim-DL is a free open-source Java-based reasoner for the language ALCHQ. It also provides a similarity measurement functionality between concepts. To access this functionality a Protégé plugin can be used.
  • HermiT is an open source reasoner based on the hypertableaux calculus. It is developed by the University of Oxford.
Editors
  • Protégé is a free, open source ontology editor and knowledge-base framework, which can use DL reasoners which offer a DIG interface as backends for consistency checks.
  • SWOOP is an open source ontology editor originally developed at the University of Maryland.
Interfaces