Maintaining knowledge about temporal intervals
@article{Allen1983MaintainingKA, title={Maintaining knowledge about temporal intervals}, author={James F. Allen}, journal={Commun. ACM}, year={1983}, volume={26}, pages={832-843} }
An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation. This system is notable in offering a delicate balance between
8,579 Citations
Periodicity-Based Temporal Constraints
- Computer ScienceAI*IA
- 2005
We propose a framework for performing extensional and intensional temporal reasoning about qualitative and quantitative “periodicity-dependent” temporal constraints between repeated events, also…
Representing and propagating constraints in temporal reasoning
- Computer Science[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91
- 1991
A new temporal representation combining the notions of intervals, dates, and durations is presented, based on the notion of time map managers (TMMs), allowing both kinds of constraints, symbolic or numeric.
Implementation of the temporal reasoning mechanism in modern intelligent systems
- Computer Science
- 2007
A modern approach to temporal reasoning modeling in intelligent systems designed for dynamic subject domains is considered. Purposes, problems, and principles of construction of temporal reasoning…
On Non-Binary Temporal Relations
- PhilosophyECAI
- 1998
I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen' s qualitative interval calculus and in quantitative temporal constraint…
On-line Qualitative Temporal Reasoning with Explanation
- Computer ScienceFLAIRS
- 2006
This work is a confluence of three problems in constraint reasoning: qualitative temporal reasoning, incremental reasoning, and explanation generation, to detect the cause of inconsistency in an incremental version of the QTR problem.
Temporal Interval Reasoning with CLP(Q)
- Computer Science, Philosophy
This work proposes a refinement of the SUMO temporal ontology, implemented in CLP(Q), a Constraint Logic Programming system over the domain of rational numbers.
Constraint Propagation Algorithms for Temporal Reasoning
- Computer ScienceAAAI
- 1986
Computing the consequences of temporal assertions is shown to be computationally intractable in the interval-based representation, but not in the point-based one, but a fragment of the interval language can be expressed using the point language and benefits from the tractability of the latter.
A Temporal Constraint Reasoning System
- Business
- 2017
This paper discusses the application of using temporal constraint satisfaction in solving the schedulingproblems from the operation management domain. The Logos constraint reasoning system implements…
Reasoning under Uncertainty with Temporal Aspects
- Computer ScienceIEA/AIE
- 1992
Subject to this paper is an extension of the model of Bayesian networks that is capable of handling temporal constraints that has been developed under the expert system shell KEE on a TI micro-explorer.
References
SHOWING 1-10 OF 16 REFERENCES
A System for Reasoning About Time
- Computer ScienceAAAI
- 1982
The salient features of a new system for reasoning about time that represents time primarily — though not exclusively — in terms of intervals, and performs deductions on this representation has a mechanism for maintaining consistency in the representation and discovering the origin of inconsistencies.
Planning Using a Temporal World Model
- Computer ScienceIJCAI
- 1983
A world model based on a temporal logic allows the problem solver to gather constraints on the ordering of actions without having to commit to an ordering when a conflict is detected, and allows more general descriptions of actions that may occur simultaneously or overlap.
A Model for Temporal References and Its Application in a Question Answering Program
- Computer ScienceArtif. Intell.
- 1972
A Sufficient Condition for Backtrack-Free Search
- BusinessJACM
- 1982
A relationship involving the structure of the constraints is described which characterizes to some degree the extreme case of mimmum backtracking and a concept called "width," which may provide some guidance in the representation of constraint satisfaction problems and the order in which they are searched.
A Structure for Plans and Behavior
- Computer Science
- 1977
Progress to date in the ability of a computer system to understand and reason about actions is described, and the structure of a plan of actions is as important for problem solving and execution monitoring as the nature of the actions themselves.
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
- MathematicsIJCAI
- 1971
SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE
- Philosophy, Computer Science
- 1981