Time-dependent concepts: representation and reasoning using temporal description logics

doi:10.1016/S0169-023X(96)00036-5

Data & Knowledge Engineering

Volume 22, Issue 1, March 1997, Pages 1-38

https://doi.org/10.1016/S0169-023X(96)00036-5 Get rights and content

Abstract

A time-dependent concept is a conceptual entity that is defined in terms of temporal relationships with other entities. For example, the concept of an action is defined in terms of a set of temporal relationships among states of a system. The concept of “widow”, in natural language, is defined in terms of events that have occurred in the past. Time-dependent concepts appear in several application areas, from natural language to diagnosis, from planning to data mining. An interesting issue in knowledge representation is how to formally represent and reason with these concepts. In this paper, we represent a family of formal representation languages obtained as an interval-based temporal extension of description logics. We illustrate the expressiveness of these formalisms in representing time-dependent concepts with respect to standard description logics and other extensions. We give some complexity results for reasoning problems and we propose approximate algorithms to compute subsumption among time-dependent concepts.

References (41)

R.E Fikes et al.
Strips: a new approach to the application of theorem proving to problem solving
Artificial Intelligence
(1971)
B Nebel
Terminological reasoning is inherently intractable
Artificial Intelligence
(1990)
M Schmidt-Schauß et al.
Attribute concept descriptions with complements
Artificial Intelligence
(February 1991)
W.A Woods et al.
The KL-ONE family
Computer and Mathematics with Applications, special issue: Semantic Networks in Artificial Intelligence
(1992)
J.F Allen
Maintaining knowledge about temporal intervals
Communications of the ACM
(November 1983)
J.F Allen
Planning as temporal reasoning
A Artale et al.
Homogeneous concepts in a temporal description logic
A Artale et al.
A computational account for a description logic of time and action
F Baader et al.
Terminological Logics with Modal Operators
S Beneventano et al.
Using subsumption in semantic query optimization

S Bergamaschi et al.

On taxonomic reasoning in conceptual design

ACM Transactions on Database Systems

(1992)

E Bertino et al.

The integration of heterogeneous data management systems: Approaches based on the object-oriented paradigm

C Bettini

Taxonomic reasoning on temporal descriptions

C Bettini

Estensioni temporali dei linguaggi terminologici

C Bettini

A family of temporal terminological logics

C Bettini

A formalization of interval-based temporal subsumption in first order logic

C Bettini et al.

Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining

A Borgida

Descriptions logics in data management

IEEE Transactions on Knowledge and Data Engineering

(October 1995)

A Borgida et al.

CLASSIC: A structural data model for objects

ACM SIGMOD RECORD

(June 1989)

R.J Brachman et al.

The tractability of subsumption in frame-based description languages

Cited by (25)

On coarser interval temporal logics
2019, Artificial Intelligence
Citation Excerpt :
ITLs have been applied in several fields such as hardware and real-time system verification, language processing, constraint satisfaction and planning [38,2,21,40]. Moreover, due to the fact that temporal logics are considered as the natural basis for temporal extensions of Description Logics [6], several attempts have been made to design interval-based extensions of such formalisms [41,10,5,4]. ITLs can be also considered as the temporal counterpart of TSQL, that is, the temporal extension to the language SQL for databases, included in the standard SQL:2011 [45].
The primary characteristic of interval temporal logic is that intervals, rather than points, are taken as the primitive ontological entities. Given their generally bad computational behavior of interval temporal logics, several techniques exist to produce decidable and computationally affordable temporal logics based on intervals. In this paper we take inspiration from Golumbic and Shamir's coarser interval algebras, which generalize the classical Allen's Interval Algebra, in order to define two previously unknown variants of Halpern and Shoham's logic (HS) based on coarser relations. We prove that, perhaps surprisingly, the satisfiability problem for the coarsest of the two variants, namely ${HS}_{3}$ , not only is decidable, but PSpace-complete in the finite/discrete case, and PSpace-hard in any other case; besides proving its complexity bounds, we implement a tableau-based satisfiability checker for it and test it against a systematically generated benchmark. Our results are strengthened by showing that not all coarser-than-Allen's relations are a guarantee of decidability, as we prove that the second variant, namely ${HS}_{7}$ , remains undecidable in all interesting cases.
Chapter 20 Time in qualitative simulation
2005, Foundations of Artificial Intelligence
ε-connections of abstract description systems
2004, Artificial Intelligence
Combining knowledge representation and reasoning formalisms is an important and challenging task. It is important because non-trivial AI applications often comprise different aspects of the world, thus requiring suitable combinations of available formalisms modeling each of these aspects. It is challenging because the computational behavior of the resulting hybrids is often much worse than the behavior of their components.
In this paper, we propose a new combination method which is computationally robust in the sense that the combination of decidable formalisms is again decidable, and which, nonetheless, allows non-trivial interactions between the combined components.
The new method, called $E$ -connection, is defined in terms of abstract description systems (ADSs), a common generalization of description logics, many logics of time and space, as well as modal and epistemic logics. The basic idea of $E$ -connections is that the interpretation domains of n combined systems are disjoint, and that these domains are connected by means of n-ary ‘link relations’. We define several natural variants of $E$ -connections and study in-depth the transfer of decidability from the component systems to their $E$ -connections.
Combining interval-based temporal reasoning with general TBoxes
2004, Artificial Intelligence
While classical Description Logics (DLs) concentrate on the representation of static conceptual knowledge, recently there is a growing interest in DLs that, additionally, allow to capture the temporal aspects of conceptual knowledge. Such temporal DLs are based either on time points or on time intervals as the temporal primitive. Whereas point-based temporal DLs are well-investigated, this is not the case for interval-based temporal DLs: all known logics either suffer from rather limited expressive power or have undecidable reasoning problems. In particular, there exists no decidable interval-based temporal DL that provides for general TBoxes—one of the most important expressive means in modern description logics. In this paper, for the first time we define an interval-temporal DL that is equipped with general TBoxes and for which reasoning is decidable (and, more precisely, ExpTime-complete).
Dynamic rule refinement in knowledge-based data mining systems
2001, Decision Support Systems
Citation Excerpt :
Data mining is defined as the nontrivial extraction of implicit, previously unknown, and potentially useful information from data [13]. Specific methods used in data mining applications include statistical pattern recognition (e.g., Refs. [14,16,18]), association rules (e.g., Refs. [1,2,7,37]), recognizing sequential or temporal (time series) patterns (e.g., Refs. [4,5,22]), clustering or segmentation, (e.g., Ref. [12]), data visualization (e.g., Refs. [21,24,35]), and classification (e.g., Refs. [3,9,20]). A typical example application for association rules is market basket analysis.
The availability of relatively inexpensive computing power as well as the ability to obtain, store, and retrieve huge amounts of data has spurred interest in data mining. In a majority of data mining applications, most of the effort is spent in cleaning the data and extracting useful patterns in the data. However, a critical step in refining the extracted knowledge especially in dynamic environments is often overlooked. This paper focuses on knowledge refinement, a necessary process to obtain and maintain current knowledge in the domain of interest. The process of knowledge refinement is necessary not only to have accurate and effective knowledge bases but also to dynamically adapt to changes. KREFS, a knowledge refinement system, is presented and evaluated in this paper.
KREFS refines knowledge by intelligently self-guiding the generation of new training examples. Avoiding typical problems associated with dependency on domain knowledge, KREFS identifies and learns distinct concepts from scratch. In addition to improving upon features of existing knowledge refinement systems, KREFS provides a general framework for knowledge refinement. Compared to other knowledge refinement systems, KREFS is shown to have more expressive power that renders its applicability in more realistic applications involving the management of knowledge.
Design ontology in context - A situated cognition approach to conceptual modelling
2001, Artificial Intelligence in Engineering
If we take a situated view of cognition, human thought and action are inextricably connected and affected by the context. It is not just the external environment that will affect the context but that thinking itself modifies further action and context occurs at a conceptual level that exists within a social setting. Thus, a situated view of knowledge necessitates knowledge acquisition techniques which handle change. This is particularly true of design knowledge where the design will change as more experience is gained and the changing model will itself change the perception of a design while designing. The approach described in this paper is based on the view that knowledge is always evolving and the premise that it is not easy to capture or evaluate a conceptual model. The alternative offered is based on the combined use of cases, ripple-down rules (RDR), formal concept analysis (FCA) and the Activity/Space (A/S) ontology. Cases are design episodes and used to motivate the capture of rules in a simple user-driven manner. Cases ground the KBS in the real world and provide the context in which the knowledge applies. Rules are the indexes by which the cases are retrieved. Using FCA, we are able to build an abstraction hierarchy of the rules and cases. To facilitate comparison and validation we use A/S design ontology to acquire a consistently organised set of cases. This ontology provides a common structure and shared set of descriptive terms. The ease with which the knowledge is acquired and maintained using RDR, the use of a dynamic design ontology and the automatic generation of conceptual models using FCA allows for the continual evolution of the KBS in keeping with the notion that knowledge is continually evolving and ‘made-up’ to fit the situation.

View all citing articles on Scopus

View full text

PaperTime-dependent concepts: representation and reasoning using temporal description logics

Abstract

Artificial Intelligence

Artificial Intelligence

Artificial Intelligence

Computer and Mathematics with Applications, special issue: Semantic Networks in Artificial Intelligence

Maintaining knowledge about temporal intervals

Communications of the ACM

Planning as temporal reasoning

Homogeneous concepts in a temporal description logic

A computational account for a description logic of time and action

Terminological Logics with Modal Operators

Using subsumption in semantic query optimization

On taxonomic reasoning in conceptual design

ACM Transactions on Database Systems

The integration of heterogeneous data management systems: Approaches based on the object-oriented paradigm

Taxonomic reasoning on temporal descriptions

Estensioni temporali dei linguaggi terminologici

A family of temporal terminological logics

A formalization of interval-based temporal subsumption in first order logic

Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining

Descriptions logics in data management

IEEE Transactions on Knowledge and Data Engineering

CLASSIC: A structural data model for objects

ACM SIGMOD RECORD

The tractability of subsumption in frame-based description languages

Paper
Time-dependent concepts: representation and reasoning using temporal description logics