Results 1 
9 of
9
Reasoning about Qualitative Temporal Information
 Artificial Intelligence
, 1992
"... Representing and reasoning about incomplete and indefinite qualitative temporal information is an essential part of many artificial intelligence tasks. An intervalbased framework and a pointbased framework have been proposed for representing such temporal information. In this paper, we address ..."
Abstract

Cited by 137 (6 self)
 Add to MetaCart
Representing and reasoning about incomplete and indefinite qualitative temporal information is an essential part of many artificial intelligence tasks. An intervalbased framework and a pointbased framework have been proposed for representing such temporal information. In this paper, we address two fundamental reasoning tasks that arise in applications of these frameworks: Given possibly indefinite and incomplete knowledge of the relationships between some intervals or points, (i) find a scenario that is consistent with the information provided, and (ii) find the feasible relations between all pairs of intervals or points. For the pointbased framework and a restricted version of the intervalbased framework, we give computationally efficient procedures for finding a consistent scenario and for finding the feasible relations. Our algorithms are marked improvements over the previously known algorithms. In particular, we develop an O(n 2 ) time algorithm for finding one co...
Complexity and Algorithms for Reasoning About Time: A GraphTheoretic Approach
, 1992
"... Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence ..."
Abstract

Cited by 86 (11 self)
 Add to MetaCart
Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics. The satisfiability, minimal labeling, all solutions and all realizations problems are considered for temporal (interval) data. Several versions are investigated by restricting the possible interval relationships yielding different complexity results. We show that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NPcomplete. On the positive side, we give efficient algorithms for several restrictions of the problem. In the process, the interval graph sandwich problem is introduced, and is shown to be NPcomplete. This problem is als...
Temporal Constraints: A Survey
, 1998
"... . Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between them. Information is represented as a Constraint Satisfaction Problem (CSP) where variables denote event times and constraints re ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between them. Information is represented as a Constraint Satisfaction Problem (CSP) where variables denote event times and constraints represent the possible temporal relations between them. The main tasks are two: (i) deciding consistency, and (ii) answering queries about scenarios that satisfy all constraints. This paper overviews results on several classes of Temporal CSPs: qualitative interval, qualitative point, metric point, and some of their combinations. Research has progressed along three lines: (i) identifying tractable subclasses, (ii) developing exact search algorithms, and (iii) developing polynomialtime approximation algorithms. Most available techniques are based on two principles: (i) enforcing local consistency (e.g. pathconsistency), and (ii) enhancing naive backtracking search. Keywords: Temporal Constra...
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 15 (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
Spatial Reasoning about Points in a Multidimensional Setting
"... This paper organizes, for every n 1, the topologic forms of the possible relations between the Cartesian coordinates of two points of the Euclidean space of dimension n over the field of real numbers. Working out n dimensional point algebra on the pattern of point algebra and cardinal relati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper organizes, for every n 1, the topologic forms of the possible relations between the Cartesian coordinates of two points of the Euclidean space of dimension n over the field of real numbers. Working out n dimensional point algebra on the pattern of point algebra and cardinal relation algebra, it introduces the concept of convexity just as the one of preconvexity. Adapting the propagation techniques designed to solve point networks or cardinal relation networks, it shows that these concepts are preserved by the fundamental operations of composition, conversion and intersection. Finally, it proposes a set of n dimensional point networks, the strongly preconvex ndimensional point networks, whose consistency can be decided in polynomial time by means of the pathconsistency algorithm or the weak pathconsistency algorithm. Keywords: Spatial reasoning, Constraint satisfaction problems, Tractability. 1 Introduction Artificial intelligence and computer sci...
Exact and Approximate Reasoning about Temporal Relations
"... Allen gives an algebra for representing qualitative temporal information about the relationships between pairs of intervals. In this paper, we address a fundamental reasoning task that arises in applications of the algebra: Given (possibly indefinite) knowledge about the relationships between interv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Allen gives an algebra for representing qualitative temporal information about the relationships between pairs of intervals. In this paper, we address a fundamental reasoning task that arises in applications of the algebra: Given (possibly indefinite) knowledge about the relationships between intervals, find all feasible relationships between two intervals. We call this the minimal labels problem. Finding the minimal labels can be viewed as computing the deductive consequences of our knowledge. Determining exact solutions to this problem has been shown to be (almost assuredly) intractable. Allen gives an approximation algorithm based on constraint propagation. We present new approximation algorithms, determine analytically under what conditions the algorithms are exact, and examine, through some computational experiments, the quality of the approximate solutions produced by the algorithms. We also give a simple test for predicting when the approximation algorithms will and will not produce good quality approximations. Finally, we survey three example applications of the interval algebra chosen from the literature to show where the results of this paper could be useful. Ke ywords: temporal reasoning, interval algebra, point algebra, constraint satisfaction.
Reasoning about generalized intervals: Horn representability and tractability
, 2000
"... This paper organizes the topologic forms of the possible relations between generalized intervals. Working out generalized interval algebra on the pattern of point algebra and interval algebra, it introduces the concept of Horn representability just as the one of convexity. It gives the class of H ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper organizes the topologic forms of the possible relations between generalized intervals. Working out generalized interval algebra on the pattern of point algebra and interval algebra, it introduces the concept of Horn representability just as the one of convexity. It gives the class of Horn representable relations a simple characterization based on the concept of strong preconvexity. Adapting the propagation techniques designed to solve the networks of constraints between points or between intervals, it shows that the issue of consistency of a Horn representable generalized interval network can be solved in polynomial time by means of the weak pathconsistency algorithm, a new incomplete algorithm for computing a minimal set of temporal constraints. 1 INTRODUCTION It is hard to overemphasize the importance for computer science and artificial intelligence of the development of reasoning systems that are concerned with temporal information. The thing is that the natur...
A NOVEL MODEL FOR TIMED EVENT EXTRACTION AND TEMPORAL REASONING IN LEGAL TEXT DOCUMENTS
"... Information Retrieval is in a nascent stage to provide any type of information queried by naïve user. Question Answering System is one such successful area of Information retrieval. Legal Documents (case law, statute or transactional document) are increasing day by day with the new applications (Mob ..."
Abstract
 Add to MetaCart
Information Retrieval is in a nascent stage to provide any type of information queried by naïve user. Question Answering System is one such successful area of Information retrieval. Legal Documents (case law, statute or transactional document) are increasing day by day with the new applications (Mobile transactions, Medical Diagnosis reports, law cases etc.) in the world. Documentation of various Business and Human Resource (HR) applications involve Legal documents. Analysis and temporal reasoning of such documents is a demanding area of research. In this paper we build a novel model for timed event extraction and temporal reasoning in legal text documents. This paper mainly works on “how one can do further reasoning with the extracted temporal information”. Exploring temporal information in legal text documents is an important task to support legal practitioner lawyer, in order to determine temporal based context decisions. Legal documents are available in different natural languages; hence it uses NLP System for preprocessing steps, Temporal constraint structure for temporal expressions, associated tagger, PostProcessor with a knowledgebased sub system helps in discovering implicit information. The resultant information resolves temporal expressions and deals with issues such as granularity, vagueness, and a reasoning mechanism which models the temporal constraint satisfaction network.