scholarly journals DL-Lite Contraction and Revision

2016 ◽  
Vol 56 ◽  
pp. 329-378 ◽  
Author(s):  
Zhiqiang Zhuang ◽  
Zhe Wang ◽  
Kewen Wang ◽  
Guilin Qi
Keyword(s):  
Finite Number ◽  
Infinite Number ◽  
Description Logic ◽  
Belief Change ◽  
Knowledge Bases ◽  
Theoretic Approach ◽  
Alternative Semantics ◽  
Representation Theorems ◽  
Standard Description ◽  
Model Based

Two essential tasks in managing description logic knowledge bases are eliminating problematic axioms and incorporating newly formed ones. Such elimination and incorporation are formalised as the operations of contraction and revision in belief change. In this paper, we deal with contraction and revision for the DL-Lite family through a model-theoretic approach. Standard description logic semantics yields an infinite number of models for DL-Lite knowledge bases, thus it is difficult to develop algorithms for contraction and revision that involve DL models. The key to our approach is the introduction of an alternative semantics called type semantics which can replace the standard semantics in characterising the standard inference tasks of DL-Lite. Type semantics has several advantages over the standard one. It is more succinct and importantly, with a finite signature, the semantics always yields a finite number of models. We then define model-based contraction and revision functions for DL-Lite knowledge bases under type semantics and provide representation theorems for them. Finally, the finiteness and succinctness of type semantics allow us to develop tractable algorithms for instantiating the functions.

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.

An Infinite Number of Laminagrams from a Finite Number of Radiographs

Radiology ◽  
1971 ◽  
Vol 98 (2) ◽  
pp. 249-255 ◽  
Author(s):  
Earl R. Miller ◽  
Edward M. MoCurry ◽  
Bernard Hruska
Keyword(s):  
Finite Number ◽  
Infinite Number

Some comments on positron–atom scattering at intermediate energy

1982 ◽  
Vol 60 (4) ◽  
pp. 558-564 ◽  
Author(s):  
F. W. Byron Jr.
Keyword(s):  
Finite Number ◽  
Cross Sections ◽  
Infinite Number ◽  
Intermediate Energy ◽  
Total Cross Sections ◽  
Type Approximation ◽  
Atom Scattering ◽  
Target States

A brief survey of available theoretical techniques is given for positron–atom scattering. The distinction between methods involving a finite number of target states and those with an infinite number of target states is emphasized. The situation regarding total cross sections is summarized, and a new, non-perturbative, eikonal-type approximation, based on the work of Wallace, is introduced.

scholarly journals Research of Register Pressure Aware Loop Unrolling Optimizations for Compiler

2018 ◽  
Vol 228 ◽  
pp. 03008
Author(s):  
Xuehua Liu ◽  
Liping Ding ◽  
Yanfeng Li ◽  
Guangxuan Chen ◽  
Jin Du
Keyword(s):  
Finite Number ◽  
Infinite Number ◽  
Performance Degradation ◽  
Transformation Process ◽  
Fine Grained ◽  
Loop Unrolling ◽  
Average Improvement ◽  
Register Pressure ◽  
Linpack Benchmark ◽  
Loop Optimizations

Register pressure problem has been a known problem for compiler because of the mismatch between the infinite number of pseudo registers and the finite number of hard registers. Too heavy register pressure may results in register spilling and then leads to performance degradation. There are a lot of optimizations, especially loop optimizations suffer from register spilling in compiler. In order to fight register pressure and therefore improve the effectiveness of compiler, this research takes the register pressure into account to improve loop unrolling optimization during the transformation process. In addition, a register pressure aware transformation is able to reduce the performance overhead of some fine-grained randomization transformations which can be used to defend against ROP attacks. Experiments showed a peak improvement of about 3.6% and an average improvement of about 1% for SPEC CPU 2006 benchmarks and a peak improvement of about 3% and an average improvement of about 1% for the LINPACK benchmark.

A definition of existence in terms of abstraction and disjunction

1957 ◽  
Vol 22 (4) ◽  
pp. 343-344
Author(s):  
Frederic B. Fitch
Keyword(s):  
Finite Number ◽  
Infinite Number ◽  
Recursive Relation ◽  
Basic Logic ◽  
Class A ◽  
Definition Of ◽  
Image Position

Greater economy can be effected in the primitive rules for the system K of basic logic by defining the existence operator ‘E’ in terms of two-place abstraction and the disjunction operator ‘V’. This amounts to defining ‘E’ in terms of ‘ε’, ‘έ’, ‘o, ‘ό’, ‘W’ and ‘V’, since the first five of these six operators are used for defining two-place abstraction.We assume that the class Y of atomic U-expressions has only a single member ‘σ’. Similar methods can be used if Y had some other finite number of members, or even an infinite number of members provided that they are ordered into a sequence by a recursive relation represented in K. In order to define ‘E’ we begin by defining an operator ‘D’ such thatHere ‘a’ may be thought of as an existence operator that provides existence quantification over some finite class of entities denoted by a class A of U-expressions. In other words, suppose that ‘a’ is such that ‘ab’ is in K if and only if, for some ‘e’ in A, ‘be’ is in K. Then ‘Dab’ is in K if and only if, for some ‘e and ‘f’ in A, ‘be’ or ‘b(ef)’ is in K; and ‘a’, ‘Da’, ‘D(Da)’, and so on, can be regarded as existence operators that provide for existence quantification over successively wider and wider finite classes. In particular, if ‘a’ is ‘εσ’, then A would be the class Y having ‘σ’ as its only member, and we can define the unrestricted existence operator ‘E’ in such a way that ‘Eb’ is in K if and only if some one of ‘εσb’, ‘D(εσ)b’, ‘D(D(εσ))b’, and so on, is in K.

Sign in / Sign up

Export Citation Format

Share Document