Goal Representation and Reasoning based on Description Logics(DLs)

Phasic Alertness and the Residual Task-Switching Cost

Experimental Psychology (formerly Zeitschrift für Experimentelle Psychologie) ◽

10.1027/1618-3169.52.2.109 ◽

2005 ◽

Vol 52 (2) ◽

pp. 109-124 ◽

Cited By ~ 27

Author(s):

Nachshon Meiran ◽

Ziv Chorev

Keyword(s):

Task Switching ◽

Target Stimulus ◽

Switching Cost ◽

Optimal Interval ◽

Phasic Alertness ◽

Goal Representation

Abstract. Participants switched between two randomly ordered discrimination tasks and each trial began with the presentation of a task cue instructing which task to execute. The authors induced phasic alertness by presenting a salient uninformative stimulus after the task cue was provided, and at variable intervals before the target stimulus was presented (Experiments 1-3) or before the task cue (Experiment 4). When the alerting stimulus preceded the target stimulus or the task cue by an optimal interval, RT was faster, indicating an alert state and the task-switching cost was reduced. These results support the suggestion of De Jong (Acta Psychologica, 1999 ) that alertness improves the overcoming of retrieval competition through improved goal representation, but also show that the effect is specific to the residual task-switching cost.

Download Full-text

Semantic Web Service Composition Based on Dynamic Description Logics

Chinese Journal of Computers ◽

10.3724/sp.j.1016.2013.02468 ◽

2014 ◽

Vol 36 (12) ◽

pp. 2468-2478 ◽

Cited By ~ 1

Author(s):

Liang CHANG ◽

Jin LIU ◽

Tian-Long GU ◽

Zhong-Zhi SHI

Keyword(s):

Semantic Web ◽

Web Service ◽

Service Composition ◽

Description Logics ◽

Web Service Composition ◽

Semantic Web Service ◽

Dynamic Description ◽

Semantic Web Service Composition

Download Full-text

On the relation between keys and link keys for data interlinking

Semantic Web ◽

10.3233/sw-200414 ◽

2020 ◽

pp. 1-21

Author(s):

Manuel Atencia ◽

Jérôme David ◽

Jérôme Euzenat

Keyword(s):

Description Logics ◽

The Other ◽

Formal Framework ◽

Precise Relationship

Both keys and their generalisation, link keys, may be used to perform data interlinking, i.e. finding identical resources in different RDF datasets. However, the precise relationship between keys and link keys has not been fully determined yet. A common formal framework encompassing both keys and link keys is necessary to ensure the correctness of data interlinking tools based on them, and to determine their scope and possible overlapping. In this paper, we provide a semantics for keys and link keys within description logics. We determine under which conditions they are legitimate to generate links. We provide conditions under which link keys are logically equivalent to keys. In particular, we show that data interlinking with keys and ontology alignments can be reduced to data interlinking with link keys, but not the other way around.

Download Full-text

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

Fundamenta Informaticae ◽

10.3233/fi-2020-1977 ◽

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.

Download Full-text