scholarly journals A Formal Method for Service Choreography Verification based on Description Logic

2020 ◽  
Vol 62 (2) ◽  
pp. 893-904
Author(s):  
Zhang Tingting ◽  
Lan Yushi ◽  
Yu Minggang ◽  
Zheng Changyou ◽  
Liu Kun
Keyword(s):  
Description Logic ◽  
Formal Method ◽  
Service Choreography

scholarly journals Verifying Service Choreography Model Based on Description Logic

2016 ◽  
Vol 2016 ◽  
pp. 1-20 ◽  
Author(s):  
Minggang Yu ◽  
Zhixue Wang ◽  
Xiaoxing Niu
Keyword(s):  
Web Services ◽  
Conceptual Framework ◽  
Description Logic ◽  
Formal System ◽  
Model Verification ◽  
Description Language ◽  
New Approach ◽  
Service Choreography ◽  
The Given

Web Services Choreography Description Language lacks a formal system to accurately express the semantics of service behaviors and verify the correctness of a service choreography model. The paper presents a new approach of choreography model verification based on Description Logic. A metamodel of service choreography is built to provide a conceptual framework to capture the formal syntax and semantics of service choreography. Based on the framework, a set of rules and constraints are defined in Description Logic for choreography model verification. To automate model verification, the UML-based service choreography model will be transformed, by the given algorithms, into the DL-based ontology, and thus the model properties can be verified by reasoning through the ontology with the help of a popular DL reasoner. A case study is given to demonstrate applicability of the method. Furthermore, the work will be compared with other related researches.

EDUCATION – RETURN TO REALITY

2020 ◽  
Vol 11 (1) ◽  
pp. 127-130
Author(s):  
Alexander Lukankin ◽  
Keyword(s):  
High Schools ◽  
Basic Education ◽  
Formal Method ◽  
Human Mind ◽  
Production Sector ◽  
The World ◽  
Soviet Russia ◽  
Correct Understanding ◽  
Natural Science Education ◽  
Technical Professions

The post-socialist transformation of general and vocational education system has led to the loss of many positive gains that were already achieved earlier. The polytechnic character of our school and its practice-oriented foundations, based on a reasonable combination of basic education and professional and applied training, were seriously undermined. Modern Russian secondary schools have become something like pre-revolutionary classical high schools, without taking into account the significant fact that in pre-Soviet Russia, along with high schools, there was a wide network of real schools. They focused students on further mastering technical professions and active participation in the production sector of the country. Today we are witnessing a global revolution in the spiritual sphere, aimed at changing the very essence of a man. Note that natural science education is valuable not only for its formal method, but also for providing the basis for a correct understanding of the world. It fosters independence of thought and distrust of other people’s words and authorities. This is the best protection of the human mind from all sorts of superstitions delusions and mysticism.

Deciding Query Entailment for Fuzzy Description Logic Knowledge Bases：The f-SH Family

2012 ◽  
Vol 35 (4) ◽  
pp. 767-785
Author(s):  
Jing-Wei CHENG ◽  
Zong-Min MA ◽  
Li YAN ◽  
Fu ZHANG
Keyword(s):  
Description Logic ◽  
Fuzzy Description

Semantics of OWL-S process model based on temporal description logic

2013 ◽  
Vol 33 (1) ◽  
pp. 266-269 ◽  
Author(s):  
Ming LI ◽  
Shiyi LIU ◽  
Fuzhong NIAN
Keyword(s):  
Process Model ◽  
Description Logic ◽  
Model Based

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆

2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Semantic Web ◽  
Set Theory ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Classification Problems ◽  
Previous Version ◽  
Decidable Fragment ◽  
Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×

2020 ◽  
Vol 176 (3-4) ◽  
pp. 349-384
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Theoretic Approach ◽  
The Novel ◽  
Data Types ◽  
Left Hand ◽  
Rule Languages ◽  
Tableau System ◽  
High Scalability ◽  
Better Than

In this paper we consider the most common TBox and ABox reasoning services for the description logic 𝒟ℒ〈4LQSR,x〉(D) ( 𝒟 ℒ D 4,× , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQSR. 𝒟 ℒ D 4,× is a very expressive description logic. It combines the high scalability and efficiency of rule languages such as the SemanticWeb Rule Language (SWRL) with the expressivity of description logics. In fact, among other features, it supports Boolean operations on concepts and roles, role constructs such as the product of concepts and role chains on the left-hand side of inclusion axioms, role properties such as transitivity, symmetry, reflexivity, and irreflexivity, and data types. We further provide a KE-tableau-based procedure that allows one to reason on the main TBox and ABox reasoning tasks for the description logic 𝒟 ℒ D 4,× . Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the γ-rule. The novel system, called KEγ-tableau, turns out to be an improvement of the system introduced in [1] and of standard first-order KE-tableaux [2]. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that in several cases the performances of the KEγ-tableau-based reasoner are up to about 400% better than the ones of the other two systems.

Sign in / Sign up

Export Citation Format

Share Document