Results 1  10
of
63
Toward Principles for the Design of Ontologies Used for Knowledge Sharing
 IN FORMAL ONTOLOGY IN CONCEPTUAL ANALYSIS AND KNOWLEDGE REPRESENTATION, KLUWER ACADEMIC PUBLISHERS, IN PRESS. SUBSTANTIAL REVISION OF PAPER PRESENTED AT THE INTERNATIONAL WORKSHOP ON FORMAL ONTOLOGY
, 1993
"... Recent work in Artificial Intelligence is exploring the use of formal ontologies as a way of specifying contentspecific agreements for the sharing and reuse of knowledge among software entities. We take an engineering perspective on the development of such ontologies. Formal ontologies are viewed a ..."
Abstract

Cited by 1789 (3 self)
 Add to MetaCart
(Show Context)
Recent work in Artificial Intelligence is exploring the use of formal ontologies as a way of specifying contentspecific agreements for the sharing and reuse of knowledge among software entities. We take an engineering perspective on the development of such ontologies. Formal ontologies are viewed as designed artifacts, formulated for specific purposes and evaluated against objective design criteria. We describe the role of ontologies in supporting knowledge sharing activities, and then present a set of criteria to guide the development of ontologies for these purposes. We show how these criteria are applied in case studies from the design of ontologies for engineering mathematics and bibliographic data. Selected design decisions are discussed, and alternative representation choices and evaluated against the design criteria.
A Framework for KnowledgeBased Temporal Abstraction
, 1997
"... A new domainindependent knowledgebased inference structure is presented, specific to the task of abstracting higherlevel concepts from timestamped data. The framework includes a model of time, parameters, events, and contexts. A formal specification of a domains temporalabstraction knowledge su ..."
Abstract

Cited by 166 (39 self)
 Add to MetaCart
A new domainindependent knowledgebased inference structure is presented, specific to the task of abstracting higherlevel concepts from timestamped data. The framework includes a model of time, parameters, events, and contexts. A formal specification of a domains temporalabstraction knowledge supports acquisition, maintenance, reuse, and sharing of that knowledge.
KnowledgeBased Temporal Abstraction in Clinical Domains
, 1996
"... We have defined a knowledgebased framework for solving the task of creating abstract, intervalbased concepts from timestamped clinical datathe knowledgebased temporalabstraction (KBTA) method. The KBTA method decomposes the temporalabstraction task into five tasks; a formal mechanism is propose ..."
Abstract

Cited by 103 (34 self)
 Add to MetaCart
We have defined a knowledgebased framework for solving the task of creating abstract, intervalbased concepts from timestamped clinical datathe knowledgebased temporalabstraction (KBTA) method. The KBTA method decomposes the temporalabstraction task into five tasks; a formal mechanism is proposed for solving each subtask. The KBTA framework emphasizes the explicit representation of the knowledge required for abstraction of timeoriented clinical data, and facilitates its acquisition, maintenance, reuse, and sharing. The RSUM system implements the KBTA method. We tested RSUM in several clinical domains in which the task of monitoring patients is prominent. In particular, we tested the KBTA framework in the domain of monitoring patients who have insulindependent diabetes. We acquired from a diabetestherapy expert a diabetestherapy temporalabstraction knowledge base. Two diabetestherapy experts (including the first one) created temporal abstractions relevant to the therapymonitoring task from about 800 points of data from cases of diabetic patients. The RSUM system generated about 80% of the abstractions agreed by both experts; about 97% of the overall generated abstractions were valid. We discuss the advantages and limitations of the current architecture.
On Binary Constraint Problems
 Journal of the ACM
, 1994
"... The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of pathconsistency plays a central role. Algorithms for pathconsistency can be implemented on matrices of relations and on matrices of elements from a relation algeb ..."
Abstract

Cited by 93 (2 self)
 Add to MetaCart
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of pathconsistency plays a central role. Algorithms for pathconsistency can be implemented on matrices of relations and on matrices of elements from a relation algebra. We give an example of a 4by4 matrix of infinite relations on which no iterative local pathconsistency algorithm terminates. We give a class of examples over a fixed finite algebra on which all iterative local algorithms, whether parallel or sequential, must take quadratic time. Specific relation algebras arising from interval constraint problems are also studied: the Interval Algebra, the Point Algebra, and the Containment Algebra. 1 Introduction The logical study of binary relations is classical [8], [9], [51], [52], [56], [53], [54]. Following this tradition, Tarski formulated the theory of binary relations as an algebraic theory called relation algebra [59] 1 . Constraint satis...
A representation for collections of temporal intervals
 In Proceedings of AAAI
, 1986
"... Temporal representation and reasoning are necessary components of systems that consider events that occur in the real world. This work explores ways of considering collections of intervals of time. This line of research is motivated by related work being done by our research group on appointment sch ..."
Abstract

Cited by 69 (0 self)
 Add to MetaCart
Temporal representation and reasoning are necessary components of systems that consider events that occur in the real world. This work explores ways of considering collections of intervals of time. This line of research is motivated by related work being done by our research group on appointment scheduling and time management. Natural language expressions that refer to collections of intervals are used naturally and routinely in these contexts, and an effective means of representing them is essential. Previous studies, which considered intervals primarily in isolation, have difficulties in representing some classes of expressions. This occurs not only with expressions that explicitly refer to collections of intervals, such as “the first of every month, ” but also with expressions that do so only
Taxonomies of Logically Defined Qualitative Spatial Relations
 IN N. GUARINO AND R. POLI (EDS), FORMAL ONTOLOGY IN CONCEPTUAL ANALYSIS AND KNOWLEDGE REPRESENTATION
, 1994
"... This paper develops a taxonomy of qualitative spatial relations for pairs of regions, which are all logically defined from two primitive (but axiomatised) notions. The first primitive is the notion of two regions being connected, which allows eight jointly exhaustive and pairwise disjoint relations ..."
Abstract

Cited by 49 (21 self)
 Add to MetaCart
This paper develops a taxonomy of qualitative spatial relations for pairs of regions, which are all logically defined from two primitive (but axiomatised) notions. The first primitive is the notion of two regions being connected, which allows eight jointly exhaustive and pairwise disjoint relations to be defined. The second primitive is the convex hull of a region which allows many more relations to be defined. We also consider the development of the useful notions of composition tables for the defined relations and networks specifying continuous transitions between pairs of regions. We conclude by discussing what kind of criteria to apply when deciding how fine a taxonomy to create.
Dynamic Temporal Interpretation Contexts for Temporal Abstraction
 Annals of Mathematics and Artificial Intelligence
, 1998
"... ..."
Symbolic Representation of Userdefined Time Granularities
 Annals of Mathematics and Artificial Intelligence
, 1999
"... In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities, in order to have a common framework for their specification, and to allow the interoperability of systems adopting different time granu ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities, in order to have a common framework for their specification, and to allow the interoperability of systems adopting different time granularities. This paper considers the mathematical characterization of finite and periodical time granularities, and it identifies a userfriendly symbolic formalism which captures exactly that class of granularities. This is achieved by a formal analysis of the expressiveness of wellknown symbolic representation formalisms. 1. Introduction There is a wide agreement in the AI and database community on the requirement for a data/knowledge representation system of supporting standard as well as userdefined time granularities. Examples of standard time granularities are days, weeks, months, while user defined granularities may include businessweeks, tradingdays, workingshifts, schoolterms, wi...
The Logic of Time Representation
, 1987
"... This investigation concerns representations of time by means of intervals, stemming from work of Allen [All83] and van Benthem [vBen83]. Allen described an Interval Calculus of thirteen binary relations on convex intervals over a linear order (the real numbers). He gave a practical algorithm for che ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
This investigation concerns representations of time by means of intervals, stemming from work of Allen [All83] and van Benthem [vBen83]. Allen described an Interval Calculus of thirteen binary relations on convex intervals over a linear order (the real numbers). He gave a practical algorithm for checking the consistency of a subclass of Boolean constraints. First, we describe a completeness theorem for Allen's calculus, in its corresponding formulation as a firstorder theory LM . LM is countably categorical, and axiomatises the complete theory of intervals over a dense unbounded linear order. Its only countable model up to isomorphism is the nontrivial intervals over the rational numbers. Algorithms are given for quantiferelimination, consistency checking, and satisfaction of arbitrary firstorder formulas in the Interval Calculus. A natural countable model of the calculus is presented, the TUS , in which clock and calendartime may be represented in a straightforward way. Allen an...
Temporal Representation and Reasoning in Artificial Intelligence: Issues and Approaches
, 2002
"... this paper, we survey a wide range of research in temporal representation and reasoning, without committing ourselves to the point of view of any speci c application ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
this paper, we survey a wide range of research in temporal representation and reasoning, without committing ourselves to the point of view of any speci c application