# Applying local search to temporal reasoning

@article{Thornton2002ApplyingLS, title={Applying local search to temporal reasoning}, author={J. Thornton and M. Beaumont and A. Sattar and Michael J. Maher}, journal={Proceedings Ninth International Symposium on Temporal Representation and Reasoning}, year={2002}, pages={94-99} }

Local search techniques have attracted considerable interest in the artificial intelligence (AI) community since the development of GSAT (Selman et al., 1992) and the min-conflicts heuristic (Minton et al., 1992) for solving large propositional satisfiability (SAT) problems and binary constraint satisfaction problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Method (DLM) (Shang and Wah, 1998), have significantly improved on GSAT and can also be applied to… Expand

#### 6 Citations

A Local Search Approach to Modelling and Solving Interval Algebra Problems

- Computer Science
- J. Log. Comput.
- 2004

This paper looks at modelling and solving problems formulated using Allen's interval algebra and proposes a new constraint weighting algorithm derived from DLM and shows that local search outperforms existing consistency-enforcing algorithms on those problems that the existing techniques find most difficult. Expand

Solving Over-Constrained Temporal Reasoning Problems Using Local Search

- Computer Science
- PRICAI
- 2004

Inspired by the recent success in efficiently handling reasonably large satisfiable temporal reasoning problems using local search, two new local search algorithms using a random restart strategy and a TABU search are developed and the previous constraint weighting algorithm is extended to handle over-constrained problems. Expand

Temporal Representation and Reasoning

- Computer Science, Mathematics
- Handbook of Knowledge Representation
- 2008

The chapter describes the use of temporal reasoning in artificial intelligence (AI) and presents an alternative logic-based view of temporal logics, including a hybrid of modal/temporal and classic aspects. Expand

Handbook of Temporal Reasoning in Artificial Intelligence

- Computer Science
- Handbook of Temporal Reasoning in Artificial Intelligence
- 2005

This collection brings together the leading researchers in a range of relevant areas and provides an coherent description of the breadth of activity concerning temporal reasoning in the filed of Artificial Intelligence. Expand

Time in Qualitative Simulation

- Computer Science
- Handbook of Temporal Reasoning in Artificial Intelligence
- 2005

#### References

SHOWING 1-10 OF 14 REFERENCES

Solving Over-Constrained Temporal Reasoning Problems Using Local Search

- Computer Science
- PRICAI
- 2004

Inspired by the recent success in efficiently handling reasonably large satisfiable temporal reasoning problems using local search, two new local search algorithms using a random restart strategy and a TABU search are developed and the previous constraint weighting algorithm is extended to handle over-constrained problems. Expand

Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class

- Computer Science, Mathematics
- Constraints
- 2004

It is proved that Ladkin and Reinefeld's algorithm is complete when using the ORD-Horn class, and evidence is given that combining search methods orthogonally can dramatically improve the performance of the backtracking algorithm. Expand

Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class

- Computer Science
- 1997

It is proved that Ladkin and Reinefeld's algorithm is complete when using the ORD-Horn class, and evidence is given that combining search methods orthogonally can dramatically improve the performance of the backtracking algorithm. Expand

A New Method for Solving Hard Satisfiability Problems

- Computer Science
- AAAI
- 1992

A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks. Expand

The design and experimental analysis of algorithms for temporal reasoning

- Computer Science
- 1996

This paper discusses the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information, and develops techniques that can result in up to a ten-fold speedup over an already highly optimized implementation. Expand

The Design and Experimental Analysis of Algorithms for Temporal Reasoning

- Computer Science
- J. Artif. Intell. Res.
- 1996

This paper discusses the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information, and develops variable and value ordering heuristics that are shown empirically to dramatically improve the performance of the algorithm. Expand

Temporal Constraints: A Survey

- Mathematics, Computer Science
- Constraints
- 2004

This paper overviews results on several classes of Temporal CSPs: qualitative interval, qualitative point, metric point, and some of their combinations. Expand

Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems

- Mathematics, Computer Science
- Artif. Intell.
- 1992

A theoretical analysis is presented both to explain why this heuristic approach to solving large-scale constraint satisfaction and scheduling problems works well on certain types of problems and to predict when it is likely to be most effective. Expand

Partial Constraint Satisfaction

- Mathematics, Computer Science
- Artif. Intell.
- 1992

A general model of partial constraint satisfaction is proposed and standard backtracking and local consistency techniques for solving constraint satisfaction problems can be adapted to cope with, and take advantage of, the differences between partial and complete constraint satisfaction. Expand

Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

- Mathematics, Computer Science
- JACM
- 1995

Using an extensive machine-generated case analysis, it is shown that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P <inline-equation> ≠</f> </inline-Equation> NP). Expand