Matches in ScholarlyData for { ?s ?p ?o. }
- 281 keyword "service modelling".
- 281 keyword "service ontology".
- 281 keyword "wsmo-lite".
- 281 title "WSMO-Lite Annotations for Web Services".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent tomas-vitvar.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jacek-kopecky.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent jana-viskova.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent dieter-fensel.
- item-4 previous item-3.
- 284 creator asuncion-gomez-perez.
- 284 creator eduardo-mena.
- 284 creator mauricio-espinoza.
- 284 type InProceedings.
- 284 label "Enriching an Ontology with Multilingual Information".
- 284 sameAs 284.
- 284 abstract "Typically ontologies are described in a determined natural language. Organizations working in a multilingual environment demand multilingual ontologies. To solve this problem we propose LabelTranslator, a NeOn plug-in that automatically localize ontologies. Ontology localization consists in adapting an ontology to a concrete language and culture community. LabelTranslator takes as input an ontology whose labels are described in a source natural language and obtains the most probable translation of each ontology label in a target natural language. Our main contribution is the automatization of this process which reduces human efforts to localize manually the ontology. First, our system uses a translation service which obtains automatic translations of each ontology label (name of an ontology term) in English, German, or Spanish by consulting different linguistic resources such as lexical databases, bilingual dictionaries, and terminologies. Second, a ranking method is used to sort each ontology label according to similarity with its lexical and structural context. The experiments performed in order to evaluate the quality of translation show that our approach is a good approximation to enrich an ontology with multilingual information.".
- 284 hasAuthorList authorList.
- 284 hasTopic Natural_language_processing.
- 284 hasTopic Ontology_%28computer_science%29.
- 284 hasTopic Semantic_Web.
- 284 hasTopic Web_Ontology_Language.
- 284 isPartOf proceedings.
- 284 keyword "multilingual ontologies".
- 284 keyword "ontology localization".
- 284 title "Enriching an Ontology with Multilingual Information".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent mauricio-espinoza.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent asuncion-gomez-perez.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent eduardo-mena.
- item-3 previous item-2.
- 291 creator riccardo-rosati.
- 291 type InProceedings.
- 291 label "Finite model reasoning in DL-Lite".
- 291 sameAs 291.
- 291 abstract "The semantics of OWL-DL and its subclasses are based on the classical semantics of first-order logic, in which the interpretation domain may be an infinite set. This constitutes a serious expressive limitation for such ontology languages, since, in many real application scenarios for the Semantic Web, the domain of interest is actually finite, although the exact cardinality of the domain is unknown. Hence, in these cases the formal semantics of the OWL-DL ontology does not coincide with its intended semantics. In this paper we start filling this gap, by considering the subclasses of OWL-DL which correspond to the logics of the DL-Lite family, and studying reasoning over finite models in such logics. In particular, we mainly consider two reasoning problems: deciding satisfiability of an ontology, and answering unions of conjunctive queries (UCQs) over an ontology. We first consider the description logic DL-Lite_R and show that, for the two above mentioned problems, finite model reasoning coincides with classical reasoning, i.e., reasoning over arbitrary, unrestricted models. Then, we analyze the description logics DL-Lite_F and DL_Lite_A. Differently from DL-Lite_R, in such logics finite model reasoning does not coincide with classical reasoning. To solve satisfiability and query answering over finite models in these logics, we define techniques which reduce polynomially both the above reasoning problems over finite models to the corresponding problem over arbitrary models. Thus, for all the DL-Lite languages considered, the good computational properties of satisfiability and query answering under the classical semantics also hold under the finite model semantics. Moreover, we have effectively and easily implemented the above techniques, extending the DL-Lite reasoner QuOnto with support for finite model reasoning.".
- 291 hasAuthorList authorList.
- 291 hasTopic Formal_languages.
- 291 hasTopic Inference.
- 291 hasTopic Logic.
- 291 hasTopic SPARQL.
- 291 hasTopic Semantic_Web.
- 291 isPartOf proceedings.
- 291 keyword "computational complexity".
- 291 keyword "description logics ontologies".
- 291 keyword "reasoning over ontologies".
- 291 title "Finite model reasoning in DL-Lite".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent riccardo-rosati.
- 292 creator ana-karla-alves-de-medeiros.
- 292 creator carlos-pedrinaci.
- 292 creator john-domingue.
- 292 type InProceedings.
- 292 label "A Core Ontology for Business Process Analysis".
- 292 sameAs 292.
- 292 abstract "Business Process Management (BPM) aims at supporting the whole life-cycle necessary to deploy and maintain business processes in organisations. An important step of the BPM life-cycle is the analysis of the processes deployed in companies. However, the degree of automation currently achieved cannot support the level of adaptation required by businesses. Initial steps have been performed towards including some sort of automated reasoning within Business Process Analysis (BPA) but this is typically limited to using taxonomies. We present a core ontology aimed at enhancing the state of the art in BPA. The ontology builds upon a Time Ontology and is structured around the process, resource, and object perspectives as typically adopted when analysing business processes. The ontology has been extended and validated by means of an Events Ontology and an Events Analysis Ontology aimed at capturing the audit trails generated by Process-Aware Information Systems and deriving additional knowledge.".
- 292 hasAuthorList authorList.
- 292 hasTopic Electronic_business.
- 292 hasTopic Semantic_Web.
- 292 hasTopic Semantic_Web_Services.
- 292 isPartOf proceedings.
- 292 keyword "business process analysis".
- 292 keyword "business process management".
- 292 keyword "ontology".
- 292 title "A Core Ontology for Business Process Analysis".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.