Filters








460,284 Hits in 2.9 sec

Matching in description logics

F Baader
1999 Journal of Logic and Computation  
In this chapter, we explain what description logics are and why they make good ontology languages.  ...  In particular, we introduce the description logic SHIQ, which has formed the basis of several well-known ontology languages, including OWL.  ...  More detail on these and other matters related to description logics can be found in [6] .  ... 
doi:10.1093/logcom/9.3.411 fatcat:oi3ruyvki5ez7c55bzmg2bflna

Matching in description logics: Preliminary results [chapter]

Franz Baader, Alex Borgida, Deborah L. McGuinness
1998 Lecture Notes in Computer Science  
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics), originally to help discard  ...  As a result, matching can be performed (in polynomial time) using arbitrary concept patterns of the description language FL : , thus removing restrictions from previous work.  ...  We began with the ltering work introduced in Classic and the theoretical work on the uni cation of concept terms and generated a formal treatment of matching in the description logic language FL ? .  ... 
doi:10.1007/bfb0054902 fatcat:fly3lrdmwjd4zdrkwvgibaal5e

Matching in the Description Logic FL0 with respect to General TBoxes (Extended abstract)

Franz Baader, Oliver Fernández Gil, Pavlos Marantidis
2019 International Workshop on Description Logics  
In Description Logic (DL), matching of concept descriptions against concept patterns was originally introduced in [12] as a non-standard inference task that can be used to filter out the unimportant  ...  We do this by first showing an ExpTime upper bound for the problem of testing whether an FL 0 matching problem has a matcher in the extended logic FL reg [1] .  ... 
dblp:conf/dlog/BaaderGM19 fatcat:lk6q57liybemncvd2ydpwo4xry

Implementing Matching in ALE--First Results

Sebastian Brandt
2003 International Workshop on Description Logics  
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs.  ...  The present paper presents an implementation of an existing matching algorithm for the DL ALE and shows first results on benchmarks w.r.t. randomly generated matching problems.  ...  Motivation Matching in Description Logics (DLs) has been first introduced by Borgida and McGuinness in the context of the Classic system [9] as a means to filter out irrelevant aspects of large concept  ... 
dblp:conf/dlog/Brandt03 fatcat:dvptf5v3wjgrhjjgeou6d6u7eu

Mathematical Service Matching Using Description Logic and OWL [chapter]

Olga Caprotti, Mike Dewar, Daniele Turi
2004 Lecture Notes in Computer Science  
This mechanism makes use of the Web Ontology Language (OWL) and a novel approach to Description Logic reasoning exploiting enterprise database technologies.  ...  Web Service technology is increasingly being used to develop distributed applications, however the convention is to describe individual services in terms of the interfaces that they expose, rather in terms  ...  This component is, in turn, built on a Description Logic reasoner accessed through the generic DIG interface.  ... 
doi:10.1007/978-3-540-27818-4_6 fatcat:46c326k755ffnhquppvxa2wqca

Matching with Respect to General Concept Inclusions in the Description Logic $\mathcal{EL}$ [chapter]

Franz Baader, Barbara Morawska
2014 Lecture Notes in Computer Science  
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system.  ...  For the DL EL, it was shown in 2000 that the matching problem is NP-complete. It then took almost 10 years before this NP-completeness result could be extended from matching to unification in EL.  ...  is a non-standard inference task in Description Logics, which was originally motivated by applications of the Classic system [8] .  ... 
doi:10.1007/978-3-319-11206-0_14 fatcat:zy2uu3s4x5hi7jarqmnezlth6m

Matching in the Description Logic FL0 with respect to General TBoxes

Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis
unpublished
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics two decades ago, motivated by applications in the Classic system.  ...  Here we show that matching in FL0 w.r.t. general TBoxes is in ExpTime, which is the best possible complexity for this problem since already subsumption w.r.t. general TBoxes is ExpTime-hard in FL0.  ...  In Description Logic (DL), matching of concept descriptions against concept patterns was originally introduced in [11] as a nonstandard inference task that can be used to filter out the unimportant aspects  ... 
doi:10.29007/q74p fatcat:jsipi3cy7ve5vhygiavtnhltma

An ontology for software component matching

Claus Pahl
2006 International Journal on Software Tools for Technology Transfer (STTT)  
We use description logics, which underlie Semantic Web ontology languages such as OWL, to develop an ontology for matching requested and provided components.  ...  A link between modal logic and description logics will prove invaluable for the provision of reasoning support for component behaviour.  ...  We develop a description logic to define the component description and matching ontology. A description logic consists of three types of entities.  ... 
doi:10.1007/s10009-006-0015-9 fatcat:geg77qtxe5gjpl3exy7capipwa

An Ontology for Software Component Matching [chapter]

Claus Pahl
2003 Lecture Notes in Computer Science  
We use description logics, which underlie Semantic Web ontology languages such as OWL, to develop an ontology for matching requested and provided components.  ...  A link between modal logic and description logics will prove invaluable for the provision of reasoning support for component behaviour.  ...  We develop a description logic to define the component description and matching ontology. A description logic consists of three types of entities.  ... 
doi:10.1007/3-540-36578-8_2 fatcat:y76dd7kzoze27m2odoklszpss4

Weak Subsumption in the EL-Description Logic with Refreshing Variables (Extended Abstract)

Theo Ducros, Marinette Bouet, Farouk Toumani
2021 International Workshop on Description Logics  
Note that, reasoning (e.g., matching or unification) in description logics with refreshing variables is not an easy task.  ...  Description Logics with Refreshing Variables.  ... 
dblp:conf/dlog/DucrosBT21 fatcat:wzjnwanvbrbclo5xstgjqpfzwi

Research on Web Service Composition Algorithm Using Description Logic

Yuemin Wang
2014 TELKOMNIKA Indonesian Journal of Electrical Engineering  
This paper presents a dynamic Web service composition algorithm based on description logic.  ...  Each input or output of the Web service request is regarded as a concept of description logic and according to the semantic similarity between concepts given the five types of description logic, we study  ...  S and D plug-in match, potentially match or partially match, let M (S, D) =0.  ... 
doi:10.11591/telkomnika.v12i1.3536 fatcat:l74lpazngzepbfrp5otisfazca

Web Components and the Semantic Web

Máire Casey, Claus Pahl
2003 Electronical Notes in Theoretical Computer Science  
Focussing on Web component composition we develop description and reasoning techniques that support a component developer in the composition activities, focussing here on matching.  ...  Subsumption is the central reasoning concept in description logics. We can integrate reasoning about service/component matching into this approach 2 .  ...  Description logic is particularly interesting for the software engineering context due to a correspondence between description logic and dynamic logic (a modal logic of programs).  ... 
doi:10.1016/s1571-0661(04)80741-2 fatcat:ztzhqdkdenaqdgunbujfrnceci

A Little Logic Goes a Long Way [chapter]

2008 Human Reasoning and Cognitive Science  
logics outperform existing matching systems.  ...  matches.  ...  logics outperform existing matching systems.  ... 
doi:10.7551/mitpress/7964.003.0005 fatcat:vit4jdg46jaxlk437bktp3mav4

Ontology support for web service processes

C. Pahl, M. Casey
2003 Software engineering notes  
We propose a formal ontology framework for these Web service processes that supports the description, matching, and composition through logic reasoning techniques.  ...  The Semantic Web, based on a description logic-based knowledge representation and reasoning framework, provides the foundations.  ...  Even though description logics can form the core of a matching ontology, in our context description logic reasoning might need to be combined with reasoning in other formal theories.  ... 
doi:10.1145/949952.940099 fatcat:4yh3phildjhp3bwfuk4yqfktwm

Ontology support for web service processes

C. Pahl, M. Casey
2003 Proceedings of the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE '03  
We propose a formal ontology framework for these Web service processes that supports the description, matching, and composition through logic reasoning techniques.  ...  The Semantic Web, based on a description logic-based knowledge representation and reasoning framework, provides the foundations.  ...  Even though description logics can form the core of a matching ontology, in our context description logic reasoning might need to be combined with reasoning in other formal theories.  ... 
doi:10.1145/940071.940099 dblp:conf/sigsoft/PahlC03 fatcat:t4txh6t5yfavjm2dlgnjcnvh5e
« Previous Showing results 1 — 15 out of 460,284 results