SHACL: A Description Logic in Disguise

Bogaerts, Bart; Jakubowski, Maxime; Bussche, Jan Van den

doi:10.1007/978-3-031-15707-3_7

Cited by 8 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SPIN can represent SPARQL rules and constraints on Semantic Web models [ 39 ]. SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs [ 40 ]. Although a portion of rule representations based on graph patterns have been proposed, most of them are based on the RDF language.…”

Section: Related Workmentioning

confidence: 99%

Knowledge graph of alpine skiing events: A focus on meteorological conditions

et al. 2022

View full text Add to dashboard Cite

Alpine skiing, as an outdoor winter sport, is particularly vulnerable to the variation of meteorological conditions. Scattered and multi-source big data cannot be fully utilized to conduct effective decision analyses by conventional data analysis methods. Presently, knowledge graphs are the most advanced organization form of knowledge base, which can make explicit the complex relationships among different objects. Thus, introducing knowledge graph to the event management of alpine skiing is significant to improve the ability of risk prediction and decision-making. In this research, we analyze the components and dynamic characteristics of alpine skiing, and construct an “Object-Characteristic-Relation” representation model to express multi-level knowledge. Moreover, we propose a “Characteristic-value- Relationship” representation method based on the multi-source data, to construct the knowledge graph of alpine skiing. With the proposed method, comprehensive relationships between meteorological conditions and alpine skiing can be represented clearly, and support further knowledge reasoning for the event management under meteorological conditions. We have tested the utility of the proposed method in a case study of 2018 Winter Olympics in PyeongChang. The case study realizes an semi-automatic construction of knowledge graph for alpine skiing, provides decision supports for event risk managements, according to different meteorological conditions, and grounds a foundation for future knowledge graph construction of other large-scale sport events.

show abstract

Section: Related Workmentioning

confidence: 99%

Knowledge graph of alpine skiing events: A focus on meteorological conditions

et al. 2022

View full text Add to dashboard Cite

show abstract

“…In particular, we are interested in the data complexity of this task, where the formula is fixed, and the input structures vary [54]. 10 Dually to this task, the complement of the problem (9) can be defined, using the fact that t is the complement of t, which is a syntactic variant of |t ⊤. For instance, if a problem in the complexity class NP is specified using the, implicitly, existential, term t, then its complement, a problem in co-NP, is specified by the term t, with an implicit universal quantifier.…”

Section: Problem: Main Task (Decision Version)mentioning

confidence: 99%

“…The Boolean algebra B(A) of a set A is the set of subsets of A that can be obtained by means of a finite number of the set operations union (OR), intersection (AND), and complementation (NOT), see pages 185-186 of Comtet's 1974 book [15]. Let H be the set of all promises, i.e., equivalence classes on functions from CH(U, M), with respect to the equivalence relation (10). For simplicity, since pairs (s → s) always contain identical strings in H, we denote this Boolean algebra as B(H).…”

Section: Boolean Algebra Of Promisesmentioning

confidence: 99%

“…The following proposition is straightforward, as it follows immediately from the semantics of terms as string-to-string transductions and the definition of the equivalence relation (10).…”

Section: Boolean Algebra Of Promisesmentioning

confidence: 99%

“…Proof. (outline) We guess a certificate, which is an equivalence class [h] (A,α) of Choice functions (a trace, see (10)), of a polynomial length in the size of A, to instantiate the free function variable ε. With such an instantiation, term α becomes deterministic.…”

Section: Data Complexity Of Query Evaluationmentioning

confidence: 99%

See 2 more Smart Citations

An Algebra of Combined Constraint Solving

Ternovska¹

EPiC Series in Computing

View full text Add to dashboard Cite

The paper describes a project aiming at developing formal foundationsof combined multi-language constraint solving in the form of an algebra of modular systems.The basis for integration of different formalisms is the classic model theory.Each atomic module is a class of structures.It can be given, e.g., by a set of constraints in a constraint formalismthat has an associated solver.Atomic modules are combined using a small number of algebraic operations.The algebra simultaneously resembles Codd's relational algebra, (but is definedon classes of structures instead of relational tables), and processalgebras originated in the work of Milner and Hoare.The goal of this paper is to establish and justifythe main notions and research directions,make definitions precise.We explain several results, but do not give proofs.The proofs will appear in several forthcoming papers.We keep this paper as a project description paper to discuss the overall project,to establish and bridge individual directions.

show abstract

Towards an ontology for process compliance with the (machinery) legislations

Gallina,

Steierhoffer,

Young Olesen

et al. 2024

J Software Evolu Process

View full text Add to dashboard Cite

Legislations impose requirements on the manufacturing of machinery. Typically, these requirements are interpreted and refined by (domain‐specific) technical committees and published in terms of standards. At the company level, these refined requirements are further interpreted, refined, and documented in terms of internal processes. Due to the proliferation of (interdependent) legislations and standards and the consequent increase of the cognitive complexity, at the company level, manual knowledge management is becoming more and more challenging and requires automated decision support. Despite the availability of approaches aimed at automating the decision support, no one offers a satisfactory solution. In this paper, we focus on knowledge management for process compliance and we propose a novel structured ontology. Our ontology aims at mastering (by dividing and conquering via tracing) the cognitive complexity of the compliance problem, when heterogeneous and sometimes geographically distributed knowledge‐driven organizational structures (legal department, standardization department, etc.) are involved and need to communicate. We also illustrate the potential usefulness of our proposed ontology in the context of pumps manufacturing and safety process compliance with the Machinery Directive and related harmonized standards including EN 809:1998+A1. Specifically, first, we identify the competencies that characterize departments and interdepartment interactions, then we formulate an initial set of competency questions that translate those identified competencies, then we show how the ontology can be exploited to retrieve the answers to the questions and how the answers can be exploited to build a justification for compliance. Precisely, we propose an argumentation pattern given in two different argumentation notations, and we show how it can be partly instantiated by exploiting the returned answers. The illustration also partly covers the compliance with the Machinery Regulation, expected to replace the Machinery Directive by January 2027. Finally, we sketch our intended future work.

show abstract

SHACL: A Description Logic in Disguise

Cited by 8 publications

References 11 publications

Knowledge graph of alpine skiing events: A focus on meteorological conditions

Knowledge graph of alpine skiing events: A focus on meteorological conditions

An Algebra of Combined Constraint Solving

Towards an ontology for process compliance with the (machinery) legislations

Contact Info

Product

Resources

About