scholarly journals The Design and Experimental Analysis of Algorithms for Temporal Reasoning

1996 ◽  
Vol 4 ◽  
pp. 1-18 ◽  
Author(s):  
P. Van Beek ◽  
D. W. Manchak

Many applications -- from planning and scheduling to problems in molecular biology -- rely heavily on a temporal reasoning component. In this paper, we discuss the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information. At the core of the system are algorithms for determining whether the temporal information is consistent, and, if so, finding one or more scenarios that are consistent with the temporal information. Two important algorithms for these tasks are a path consistency algorithm and a backtracking algorithm. For the path consistency algorithm, we develop techniques that can result in up to a ten-fold speedup over an already highly optimized implementation. For the backtracking algorithm, we develop variable and value ordering heuristics that are shown empirically to dramatically improve the performance of the algorithm. As well, we show that a previously suggested reformulation of the backtracking search problem can reduce the time and space requirements of the backtracking search. Taken together, the techniques we develop allow a temporal reasoning component to solve problems that are of practical size.

2019 ◽  
Vol 42 ◽  
Author(s):  
Daniel J. Povinelli ◽  
Gabrielle C. Glorioso ◽  
Shannon L. Kuznar ◽  
Mateja Pavlic

Abstract Hoerl and McCormack demonstrate that although animals possess a sophisticated temporal updating system, there is no evidence that they also possess a temporal reasoning system. This important case study is directly related to the broader claim that although animals are manifestly capable of first-order (perceptually-based) relational reasoning, they lack the capacity for higher-order, role-based relational reasoning. We argue this distinction applies to all domains of cognition.


2020 ◽  
Vol 32 (3) ◽  
pp. 730-746
Author(s):  
Vladyslav Sokol ◽  
Ante Ćustić ◽  
Abraham P. Punnen ◽  
Binay Bhattacharya

The bilinear assignment problem (BAP) is a generalization of the well-known quadratic assignment problem. In this paper, we study the problem from the computational analysis point of view. Several classes of neighborhood structures are introduced for the problem along with some theoretical analysis. These neighborhoods are then explored within a local search and variable neighborhood search frameworks with multistart to generate robust heuristic algorithms. In addition, we present several very fast construction heuristics. Our systematic experimental analysis disclosed some interesting properties of the BAP, different from those of comparable models. We have also introduced benchmark test instances that can be used for future experiments on exact and heuristic algorithms for the problem.


2003 ◽  
Vol 19 ◽  
pp. 469-512 ◽  
Author(s):  
L. Console ◽  
C. Picardi ◽  
D. Theseider Duprè

The automatic generation of decision trees based on off-line reasoning on models of a domain is a reasonable compromise between the advantages of using a model-based approach in technical domains and the constraints imposed by embedded applications. In this paper we extend the approach to deal with temporal information. We introduce a notion of temporal decision tree, which is designed to make use of relevant information as long as it is acquired, and we present an algorithm for compiling such trees from a model-based reasoning system.


2006 ◽  
Vol 25 ◽  
pp. 187-231 ◽  
Author(s):  
A. Gerevini ◽  
A. Saetti ◽  
I. Serina

The treatment of exogenous events in planning is practically important in many real-world domains where the preconditions of certain plan actions are affected by such events. In this paper we focus on planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows. When actions have durations, handling such temporal constraints adds an extra difficulty to planning. We propose an approach to planning in these domains which integrates constraint-based temporal reasoning into a graph-based planning framework using local search. Our techniques are implemented in a planner that took part in the 4th International Planning Competition (IPC-4). A statistical analysis of the results of IPC-4 demonstrates the effectiveness of our approach in terms of both CPU-time and plan quality. Additional experiments show the good performance of the temporal reasoning techniques integrated into our planner.


2019 ◽  
Vol 42 ◽  
Author(s):  
Simon Prosser

Abstract I offer some clarification concerning the kind of contradiction that Hoerl & McCormack's account could help explain and the scope of the metaphysical intuitions that could be explained by such a theory. I conclude that we need to know more about the sense in which the temporal reasoning system would represent time as a dimension.


2019 ◽  
Vol 42 ◽  
Author(s):  
Katharine A. Tillman

Abstract Here I consider the possible role of the temporal updating system in the development of the temporal reasoning system. Using evidence from children's acquisition of time words, I argue that abstract temporal concepts are not built from primitive representations of time. Instead, I propose that language and cultural learning provide the primary sources of the temporal reasoning system.


Sign in / Sign up

Export Citation Format

Share Document