Abstract
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a knowledge-base consisting of temporal relations, the main reasoning problem is to determine whether the knowledge-base is satisfiable, i.e., is there a scenario which is consistent with the information provided. However, many real world problems are over-constrained (i.e. unsatisfiable). To date, there has been little research aimed at solving over-constrained temporal reasoning problems. Recently, we developed standard backtracking algorithms to compute partial scenarios, in the spirit of Freuder and Wallace’s notion of partial satisfaction. While these algorithms were capable of obtaining optimal partial solutions, they were viable only for small problem sizes.
In this paper, we apply local search methods to overcome the deficiencies of the standard approach to solving over-constrained temporal reasoning problems. Inspired by our recent success in efficiently handling reasonably large satisfiable temporal reasoning problems using local search, we have developed two new local search algorithms using a random restart strategy and a TABU search. Further, we extend our previous constraint weighting algorithm to handle over-constrained problems. An empirical study of these new algorithms was performed using randomly generated under- and over-constrained temporal reasoning problems. We conclude that 1) local search significantly outperforms standard backtracking approaches on over-constrained temporal reasoning problems; and 2) the random restart strategy and TABU search have a superior performance to constraint weighting for the over-constrained problems. We also conjecture that the poorer performance of constraint weighting is due to distortions of non-zero global minima caused by the weighting process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, J.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Allen, J., Koomen, J.: Planning using a temporal world model. In: Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI), Karlsruhe, W.Germany, pp. 741–747 (1983)
Beaumont, M., Sattar, A., Maher, M., Thornton, J.: Solving over-constrained temporal reasoning problems. In: Proceedings of the 14th Australian Joint Conference on Artificial Intelligence (AI 2001), pp. 37–49 (2001)
Freuder, E., Wallace, R.: Partial constraint satisfaction. Artificial Intelligence 58(1), 21–70 (1992)
Glover, F.: Tabu search: Part 1. ORSA Journal on Computing 1(3), 190–206 (1989)
Nebel, B.: Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. Constraints 1, 175–190 (1997)
Poesio, M., Brachman, R.: Metric constraints for maintaining appointments: Dates and repeated activities. In: Proceedings of the 9th National Conference of the American Association for Artificial Intelligence (AAAI 1991), pp. 253–259 (1991)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), pp. 440–446 (1992)
Shang, Y., Wah, B.: A discrete Lagrangian-based global search method for solving satisfiability problems. J. Global Optimization 12, 61–99 (1998)
Song, F., Cohen, R.: The interpretation of temporal relations in narrative. In: Proceedings of the 7th National Conference of the American Association for Artificial Intelligence (AAAI 1988), Saint Paul, MI, pp. 745–750 (1988)
Thornton, J.: Constraint Weighting Local Search for Constraint Satisfaction. PhD thesis, School of Information Technology, Griffith University Gold Coast, Australia (January 2000)
Thornton, J., Bain, S., Sattar, A., Pham, D.: A two level local search for MAXSAT problems with hard and soft constraints. In: Proceedings of the Fifteenth Australian Joint Conference on Artificial Intelligence (AI 2002), pp. 603–614 (2002)
Thornton, J., Beaumont, M., Sattar, A., Maher, M.: Applying local search to temporal reasoning. In: Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME 2002), pp. 94–99 (2002)
Vilain, M., Kautz, H.: Constraint propagation algorithms for temporal reasoning. In: Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI 1986), pp. 377–382 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaumont, M., Thornton, J., Sattar, A., Maher, M. (2004). Solving Over-Constrained Temporal Reasoning Problems Using Local Search. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-28633-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22817-2
Online ISBN: 978-3-540-28633-2
eBook Packages: Springer Book Archive