scholarly journals Towards a Simply Typed CALculus for Semantic Knowledge Bases

10.29007/xlfw ◽  
2018 ◽  
Author(s):  
Michael Mendler ◽  
Stephan Scheele

This paper demonstrates how a constructive version of the description logic ALC can serve as a semantic type system for an extension of the simply typed $\lambda$-calculus to express computations in knowledge bases. This cALculus embodies a functional core language which provides static type checking of semantic information for programming with data whose structure is organised under a relational data model. The cALculus arises from a natural interpretation of the tableau rules for constructive ALC following the Curry-Howard-Isomorphism.

2016 ◽  
pp. 032-037
Author(s):  
V.A. Reznichenko ◽  
◽  
I.S. Chystiakova ◽  

The paper is a logical continuation of the previously published work, which was dedicated to the creation of the data manipulation methods. Based on the previously created binary relational data structure we perform mappings of the ALC extension into relational data model (RDM). The results of previous research namely data structure RM2 and mappings of the basic ALC concepts into RDM was used in this paper.


2016 ◽  
pp. 058-065
Author(s):  
I.S. Chystiakova ◽  

The paper is a logical continuation of the previously published work, which was dedicated to the creation of mappings from the description logic into binary relational data model. Based on the previously created binary relational data structure we perform mappings of the ALC extension into relational data model (RDM). The results of previous research namely data structure RM2, mappings of the basic ALC concepts and its classical extensions into RDM were used in this paper.


2012 ◽  
Vol 06 (04) ◽  
pp. 429-446 ◽  
Author(s):  
NICOLA FANIZZI ◽  
CLAUDIA D'AMATO ◽  
FLORIANA ESPOSITO ◽  
PASQUALE MINERVINI

In the context of semantic knowledge bases, among the possible problems that may be tackled by means of data-driven inductive strategies, one can consider those that require the prediction of the unknown values of existing numeric features or the definition of new features to be derived from the data model. These problems can be cast as regression problems so that suitable solutions can be devised based on those found for multi-relational databases. In this paper, a new framework for the induction of logical regression trees is presented. Differently from the classic logical regression trees and the recent fork of the terminological classification trees, the novel terminological regression trees aim at predicting continuous values, while tests at the tree nodes are expressed with Description Logic concepts. They are intended for multiple uses with knowledge bases expressed in the standard ontology languages for the Semantic Web. A top-down method for growing such trees is proposed as well as algorithms for making predictions with the trees and deriving rules. The system that implements these methods is experimentally evaluated on ontologies selected from popular repositories.


2020 ◽  
pp. 041-054
Author(s):  
I.S. Chystiakova ◽  

This paper is dedicated to the data integration problem. In article the task of practical implementation of mappings between description logic and a binary relational data model is discussed. This method was formulated earlier at a theoretical level. A practical technique to test mapping engines using RDF is provided in the current paper. To transform the constructs of the description logic ALC and its main extensions into RDF triplets the OWL 2-to-RDF mappings are used. To convert RDB to RDF graph, the R2R Mapping Language (R2R ML) was chosen. The mappings DL ALC and its main extensions to the RDF triplets are described in the publication. The mapping of the DL axioms into an RDF triplet also is considered in the publication. The main difficulties in describing DL-to-RDF transformations are given in the corresponding section. For each constructor of concepts and roles a corresponding expression in OWL 2 and its mapping into the RDF triplet. A schematic representation of the resulting RDF graph for each mapping is created. The paper also provides an overview of existing methods that relate to the use of RDF when mapping RDB to ontology and vice versa.


2017 ◽  
Vol 53 (6) ◽  
pp. 963-977 ◽  
Author(s):  
P. I. Andon ◽  
V. A. Reznichenko ◽  
I. S. Chistyakova

2017 ◽  
pp. 051-058
Author(s):  
I.S. Chystiakova ◽  

The paper is a logical continuation of the previously published work, which was dedicated to the creation of mappings from the description logic into binary relational data model. On base of the previously created binary relational data structure we perform mappings of the ALC axiomatic into relational data model (RDM). The results of previous research namely data structure RM2, mappings of the basic ALC concepts were used in this paper.


2011 ◽  
Vol 8 (1) ◽  
pp. 233-238
Author(s):  
R.M. Bogdanov ◽  
S.V. Lukin

Oil and petroleum products transportation is characterized by a significant cost of electric power. Correct oil and petroleum products accounting and forecasting requires knowledge of many factors. The software for norms of electric power consumption analysis for the planned period was developed at the Ufa Scientific Center of the Russian Academy of Sciences. Based on the principles of the relational data model, a schematic diagram/arrangement for the main oil transportation objects was developed, which allows to hold the initial data and calculated parameters in a structured manner.


2021 ◽  
Vol 43 (1) ◽  
pp. 1-73
Author(s):  
David J. Pearce

Rust is a relatively new programming language that has gained significant traction since its v1.0 release in 2015. Rust aims to be a systems language that competes with C/C++. A claimed advantage of Rust is a strong focus on memory safety without garbage collection. This is primarily achieved through two concepts, namely, reference lifetimes and borrowing . Both of these are well-known ideas stemming from the literature on region-based memory management and linearity / uniqueness . Rust brings both of these ideas together to form a coherent programming model. Furthermore, Rust has a strong focus on stack-allocated data and, like C/C++ but unlike Java, permits references to local variables. Type checking in Rust can be viewed as a two-phase process: First, a traditional type checker operates in a flow-insensitive fashion; second, a borrow checker enforces an ownership invariant using a flow-sensitive analysis. In this article, we present a lightweight formalism that captures these two phases using a flow-sensitive type system that enforces “ type and borrow safety .” In particular, programs that are type and borrow safe will not attempt to dereference dangling pointers. Our calculus core captures many aspects of Rust, including copy- and move-semantics, mutable borrowing, reborrowing, partial moves, and lifetimes. In particular, it remains sufficiently lightweight to be easily digested and understood and, we argue, still captures the salient aspects of reference lifetimes and borrowing. Furthermore, extensions to the core can easily add more complex features (e.g., control-flow, tuples, method invocation). We provide a soundness proof to verify our key claims of the calculus. We also provide a reference implementation in Java with which we have model checked our calculus using over 500B input programs. We have also fuzz tested the Rust compiler using our calculus against 2B programs and, to date, found one confirmed compiler bug and several other possible issues.


2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria

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).


Sign in / Sign up

Export Citation Format

Share Document