Temporal and Probabilistic Reasoning
Select By Year:
Select Another Subject Area:
You can also find out about my published research on Google Scholar, which, as well as providing links to the papers and their abstracts, additionally provides the latest citation counts and index values.
This page contains several constraint satisfaction papers that are specifically concerned with temporal and probabilistic reasoning (and representation). The temporal reasoning papers grew out of my collaboration with Matthew Beaumont after I became a co-supervisor for his PhD thesis. My main insight was to see how local search algorithms could be applied to the interval algebra problems that Matthew was studying. This work continued in Duc Nghia Pham’s PhD thesis and culminated in our showing how interval algebra problems can be more efficiently solved by representing them as satisfiability problems (see AIJ 2008).
There are also two papers (ADC 2004 and TIME-ICTL 2003) connected with an idea that occurred to me in a research group meeting about how to represent the present moment (i.e. now) in bitemporal database systems. And finally I assisted in the preparation of two probabilistic reasoning papers (PRICAI 2012 and JIST 2011) as part of a collaboration with Kewen Wang on an Australian Research Council Discovery Grant.
Ramachandran, R., Wang, K., Wang, J. & Thornton, J. R. (2012). Probabilistic Reasoning in DL-Lite. PRICAI 2012: 12th Pacific Rim International Conference on Artificial Intelligence, Lecture Notes in Computer Science. 7458, 480-491, Springer, ISSN 0302-9743.
Sotomayor, M., Wang, K., Shen, Y. & Thornton, J. R. (2011). Probabilistic Multi-context Systems. JIST 2011: Joint International Semantic Technology Conference. Lecture Notes in Computer Science, 7185, 366-375, Springer, ISSN 0302-9743.
Pham, D. N., Thornton, J. R. & Sattar, A. (2008). Modelling and Solving Temporal Reasoning as Propositional Satisfiability. Artificial Intelligence. 172(15), 1752-1782, ISSN 0004-3702.
Pham, D. N., Thornton, J. R. & Sattar, A. (2006). Towards an Efficient SAT Encoding for Temporal Reasoning. CP 2006: 12th International Conference on the Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, 4204, 421-436, Springer, ISSN 0302-9743.
Pham, D. N., Thornton, J. R. & Sattar, A. (2005). Modelling and Solving Temporal Reasoning as Satisfiability. Proceedings of the 4th International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Sitges, Spain. pp. 117-131.
Beaumont, M., Thornton, J. R., Sattar, A. & Maher, M. (2004). Solving Over-constrained Temporal Reasoning Problems using Local Search. PRICAI 2004: 8th Pacific Rim International Conference on Artificial Intelligence, Lecture Notes in Computer Science, 3157, 134-143, Springer, ISSN 0302-9743..
Stantic, B., Khanna, S. & Thornton, J. R. (2004). An Efficient Method for Indexing Now-relative Bitemporal Data. In ADC 2004: Proceedings of the 15th Australasian Database Conference, Australian Computer Society, pp. 113-122.
Thornton, J. R., Beaumont, M., Sattar, A. & Maher, M. (2004). A Local Search Approach to Modelling and Solving Interval Algebra Problems. Journal of Logic and Computation, 14(1), 93-112, Oxford University Press, ISSN 0955-792X.
Stantic, B., Thornton, J. R., & Sattar, A. (2003). A Novel Approach to Model NOW in Temporal Databases. In TIME-ICTL 2003: Proceedings of the 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic, IEEE, pp. 174-181.
Thornton, J. R., Beaumont, M., Sattar, A. & Maher, M. (2002). Applying Local Search to Temporal Reasoning. In: TIME 2002: 9th International Symposium on Temporal Reasoning and Representation, IEEE, pp. 94-99, ISSN 1530-1311.
Beaumont, M., Sattar, A., Maher, M., & Thornton, J. R. (2001). Solving Overconstrained Temporal Reasoning Problems. AI 2001: 14th Australian Joint Conference on Artificial Intelligence, Lecture Notes in Computer Science, 2556, 603-614, ISSN 0302-9743.