Skip Navigation CSL Home | CECS Home | ANU Home | Search ANU | HORUS | Staff Home

Diagnosis

Journal, Conference and Workshop Papers

• J. Rintanen, Complexity of diagnosability for succinct transition systems, in M. Veloso, ed., Proceedings of the 20th International Joint Conference on Artificial Intelligence, AAAI Press, 2007.
• J. Rintanen and A. Grastien, Diagnosability testing with satisfiability algorithms, in M. Veloso, ed., Proceedings of the 20th International Joint Conference on Artificial Intelligence, AAAI Press, 2007.
• A. Grastien, Utilisation des chaînes d'automates pour le diagnostic décentralisé, RFIA'06 (French congress on pattern recognition and artificial intelligence), 2006, Document (French)
• A. Grastien, M.-O. Cordier, and Ch. Largouët, Automata Slicing for Diagnosing Discrete-Event Systems with Partially Ordered Observations, AIIA'05 (Congress of the Italian Association for Artificial Intelligence), 2005, Document
• A. Grastien, M.-O. Cordier, and Ch. Largouët, Incremental Diagnosis of Discrete-Event Systems, DX'05 (International workshop on principles of Diagnosis), pp. 119--124, 2005, Document
• A. Grastien, M.-O. Cordier, and Ch. Largouët, First Steps Towards Incremental Diagnosis of Discrete-Event Systems, AI'05 (Canadian Conference on Artificial Intelligence), pp.170--181, 2005, Document
• Jinbo Huang and Adnan Darwiche. On Compiling System Models for Faster and More Scalable Diagnosis. Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pages 300–306. An earlier version appears in 16th International Workshop on Principles of Diagnosis (DX-05), pages 95–100. [PDF] [PS]
• Jinbo Huang. MUP: A Minimal Unsatisfiability Prover. Proceedings of the Tenth Asia and South Pacific Design Automation Conference (ASP-DAC-05), pages 432–437. [PDF] [PS]
• Y. Yan, Y. Pencolé, M.-O. Cordier, and A. Grastien, Monitoring Web Service Networks in a Model-based Approach, ECOWS'05 (European Conference on Web Services), 2005, Document
• A. Grastien, M.-O. Cordier, and Ch. Largouët, Extending decentralized discrete-event modelling to diagnose reconfigurable systems, DX'04 (International workshop on principles of Diagnosis), pp. 75--80, 2004, Document
• A. Schumann, Y. Pencolé, and S. Thiébaux. Diagnosis of Discrete-Event Systems using Binary Decision Diagrams 15th International Workshop on Principles of Diagnosis (DX-04), Carcassonne (France), June 2004. [pdf] © the authors.
• M.-O. Cordier, A. Grastien, Ch. Largouët, and Y. Pencolé, Calcul de trajectoires utilisant les propriétés d'interversibilité, RJCIA'03 (Rencontres Jeunes Chercheurs en Intelligence Artificielle), pp. 15--28, 2003, Document (French)
• M.-O. Cordier, A. Grastien, Ch. Largouët, and Y. Pencolé, Efficient trajectories computing exploiting inversibility properties, DX'03 (International workshop on principles of Diagnosis), pp. 93--98, 2003, Document
• M.-O. Cordier, J.-P. Krivine, P. Laborie, and S. Thiébaux. Alarm Processing and Reconfiguration in Power Distribution Systems. 11th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-98), pages 230-241, LNAI, Springer Verlag, Benicassim (Spain), June 1998.
• M.-O. Cordier, S. Thiébaux, O. Jehl and J.-P. Krivine. Supply Restoration in Power Distribution Systems: A Reference Problem in Diagnosis and Reconfiguration. 8th International Workshop on Principles of Diagnosis (DX-97), pages 37-34, Le Mont Saint Michel (France), September 1997. [ps.gz] © the authors
• S. Thiébaux, M.-O. Cordier, O. Jehl, and J.-P. Krivine. Supply restoration in Power Distribution Systems -- A Case Study in Integrating Model-Based Diagnosis and Repair Planning. 12th Conference on Uncertainty in Artificial Intelligence (UAI-96), pages 525-532, Morgan Kaufmann, Portland (OR), August 1996. [pdf] © Morgan Kaufmann
• M.-O. Cordier and S. Thiébaux. Event-Based Diagnosis for Evolutive Systems. 5th International Workshop on Principles of Diagnosis (DX-94), pages 64-69, New Palz (NY), October 1994. [ps.gz] © the authors Alternative version somewhat extended, with a different example: [ps.gz] © the authors

Theses, Technical Reports and Other

• A. Grastien, Diagnostic décentralisé et en-ligne de systèmes à événements discrets reconfigurables, Ph.D. report, dec. 2005, Document (French)

Planning

Journal, Conference and Workshop Papers

• J. Rintanen, K. Heljanko and I. Niemelä, Planning as satisfiability: parallel plans and algorithms for plan search, Artificial Intelligence, 170(12-13), pages 1031-1080, 2006.
• R. Mattmüller and J. Rintanen, Planning for temporally extended goals as propositional satisfiability, in M. Veloso, ed., Proceedings of the 20th International Joint Conference on Artificial Intelligence, AAAI Press, 2007.
• S. Hickmott, J. Rintanen, S. Thiebaux and L. White, Planning via Petri net unfolding, in M. Veloso, ed., Proceedings of the 20th International Joint Conference on Artificial Intelligence, AAAI Press, 2007.
• J. Rintanen, Unified definition of heuristics for classical planning, ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, pages 600-604, IOS Press, 2006.

• J. Rintanen, Compact representation of sets of binary constraints, ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, pages 143-147, IOS Press, 2006. [ECAI'06 talk]
• Buffet O. Reachability Analysis for Uncertain SSPs. [To appear] International Journal on Artificial Intelligence Tools.
• Buffet 0., Dutech A., Charpillet F. Shaping Multi-Agent Systems with Gradient Reinforcement Learning. [To appear] Autonomous Agents and Multi-Agens Systems Journal.
• Buffet O., Dutech A., Charpillet F. Etude de différentes combinaisons de comportements adaptatives. Revue d'Intelligence Artificielle (RIA), volume 20(2-3), 2006, pp 311-344.
• Buffet O., Aberdeen D. Planification robuste à l'aide d'une montée de gradient. Actes de la Conférence d'Apprentissage (CAp'06), Trégastel, France, 2006. [pdf]
• Patrik Haslum, "Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition". Journal of AI Research, vol 25, p. 233-267, 2006 (JAIR on-line copy).
• Jinbo Huang. Combining Knowledge Compilation and Search for Conformant Probabilistic Planning. Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-06). [PDF] [PS]
• J. Rintanen, Unified definition of heuristics for classical planning, ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, IOS Press, 2006. to appear
• I. Little and S. Thiébaux. Concurrent Probabilistic Planning in the Graphplan Framework. 16th International Conference on Automated Planning and Scheduling (ICAPS-06), AAAI Press, Cumbria (UK), June 2006. [ pdf] © AAAI Press
• S. Thiébaux, C. Gretton, J. Slaney, D. Price, and F. Kabanza. Decision-Theoretic Planning with non-Markovian Rewards. Journal of Artificial Intelligence Research 25:17-74, January 2006. [pdf] © AI Acces Foundation
• Aberdeen D., Buffet O. Simulation Methods for Uncertain Decision-Theoretic Planning. Proceedings of the IJCAI'05 Workshop on Planning and Learning in A Priori Unknown or Dynamic Domains, Edinburgh, Scotland, 2005. [pdf]
• Buffet O., Dutech A., Charpillet F. Développement autonome des comportements de base d'un agent. Revue d'Intelligence Artificielle (RIA), volume 19(4-5), 2005, pp 603-632. (extension de l'article de même titre publié dans la conférence CAp'04)
• Botea A., Enzenberger M., Müller M., and Schaeffer J. 2005. Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. In Journal of Artificial Intelligence Research, volume 24, 581-621.
• Botea A., Müller M., and Schaeffer J. 2005. Learning Partial-Order Macros from Solutions. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling ICAPS-05, 231-240, Monterey, CA, USA.
• Olivier Buffet and Douglas Aberdeen (2005) Robust Planning with (L)RTDP Proceedings of the International Joint Conference on Artificial Intelligence. July 3--August 5. Morgan Kauffman [ ps.gz | pdf ]
• Buffet O., Aberdeen D. Planification Robuste avec (L)RTDP. Actes de la Conférence d'Apprentissage (CAp'05), Nice, France, 2005. [french version of IJCAI'05 paper] [pdf]
• Buffet O. Reachability Analysis for Uncertain SSPs. Proceedings of the Seventeenth IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), Hong-Kong, China, 2005. [pdf]
• Buffet O. and Aberdeen D. A Two-Teams Approach for Robust Probabilistic Temporal Planning. Proceedings of the ECML'05 workshop on Reinforcement Learning in Non-Stationary Environments, Porto, Portugal, 2005. [pdf]
• Buffet O. Fast Reachability Analysis for Uncertain SSPs. Proceedings of the IJCAI'05 Workshop on Planning and Learning in A Priori Unknown or Dynamic Domains, Edinburgh, Scotland, 2005. [pdf]
• Patrik Haslum, Blai Bonet, Hector Geffner, "New Admissible Heuristics for Domain-Independent Planning". In Proc. AAAI, 2005 (PDF).
• F. Kabanza and S. Thiébaux. Search Control in Planning for Temporally Extended Goals. 15th International Conference on Automated Planning and Scheduling (ICAPS-05), AAAI Press, Monterey (USA), June 2005. [ pdf] © AAAI Press
• Iain Little, Douglas Aberdeen, and Sylvie Thiebaux (2005) Prottle: A Probabilistic Temporal Planner Proceedings of the American Association for Artificial Intelligence. July 9--13, Pittsburgh, PA. AAAI Press [ pdf ] [ pdf ] © AAAI Press
• Naguleswaran S., White L., Buffet O. Dynamic Programming using Quantum Search for Optimizing Petri Net Models. The IFORS Triennial 2005 Conference, Hawaii, USA, 2005.
• J. Rintanen, Conditional planning in the discrete belief space, in Proceedings of the 19th International Joint Conference on Artificial Intelligence, L. P. Kaelbling, ed., pages 1260-1265, Morgan Kaufmann Publishers, San Francisco, California, 2005.
• M. Büttner and J. Rintanen, Improving parallel planning with constraints on the number of operators, in Proceedings of the 15th International Conference on Automated Planning and Scheduling, pages 292-299, AAAI Press, 2005.
• S. Thiébaux, J. Hoffmann and B. Nebel. In Defense of PDDL Axioms. Artificial Intelligence 168(1-2):38-69, Elsevier, October 2005. [pdf] © Elsevier Short version: 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Morgan Kaufmann, Acapulco (Mexico), August 2003. [ps.gz   pdf] © IJCAII
• Douglas Aberdeen (2004) Filtered Reinforcement Learning Proceedings of the 15th European Conference on Machine Learning, Pisa, Italy. Sept 20--24. Springer-Verlag. [ ps.gz | pdf ]
• Douglas Aberdeen and Sylvie Thiebaux and Lin Zhang (2004) Decision-Theoretic Military Operations Planning International Conference on Automated Planning and Scheduling, Whistler, Canada. 3--7 June 2004. [ ps.gz | pdf ] [ software ]
• Botea A., Müller M., and Schaeffer J. 2004. Near Optimal Hierarchical Path-Finding. In Journal of Game Development, volume 1, issue 1, 7-28.
• Botea A., Müller M., and Schaeffer J. 2004. Using Component Abstraction for Automatic Generation of Macro-Actions. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling ICAPS-04, 181-190, Whistler, BC, Canada.
• Buffet O., Dutech A., Charpillet F. Self-Growth of Basic Behaviors in an Action Selection Based Agent. From Animals to Animats 8: Proceedings of the Eighth International Conference on Simulation of Adaptive Behavior (SAB'04), Los Angeles, CA, USA, 2004. [ps.gz] [pdf]
• S. Dunstall, M.E.T. Horn, P. Kilby, M. Krishnamoorthy, B. Owens, D. Sier, and S. Thiebaux. An automated itinerary planning system for holiday travel. Information Technology and Tourism, 6(3), 2004.
• Dutech A., Buffet O. and Charpillet F. Développement autonome des comportements de base d'un agent. Actes de la Conférence d'Apprentissage (CAp'04), Montpellier, France, 2004. [pdf] [ps.gz]
• C. Gretton and S. Thiébaux. Exploiting First-Order Regression in Inductive Policy Selection. 20th Conference on Uncertainty in Artificial Intelligence (UAI-04) Morgan Kaufmann, Banf (Canada), July 2004. [pdf] © the authors.
• Patrik Haslum, "Improving Heuristics Through Search" (poster/short paper). In Proc. European Conference on AI, 2004 (postscript/gzip, software).
• Patrik Haslum, "Patterns in Reactive Programs". In Proc. of the Cognitive Robotics Workshop, 2004. (postscript/gzip).
• J. Rintanen, Evaluation strategies for planning as satisfiability, in R. Lopez de Mantaras and Lorenza Saitta, eds., ECAI 2004. Proceedings of the 16th European Conference on Artificial Intelligence, pages 682-687, IOS Press, 2004. [additional material on slides of ECAI'04 talk, 8 on 1]
• J. Rintanen, K. Heljanko and I. Niemelä. Parallel encodings of classical planning as satisfiability, José Júlio Alferes and João Leite, eds., Logics in Artificial Intelligence: 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004. Proceedings, Lecture Notes in Computer Science 3229, pages 307-319, Springer-Verlag, 2004.
• J. Rintanen, Complexity of planning with partial observability, in Proceedings of the 14th International Conference on Automated Planning and Scheduling, pages 345-354, AAAI Press, 2004. (© 2004 American Association for Artificial Intelligence. All rights reserved. AAAI)
• J. Rintanen, Phase transitions in classical planning: an experimental study, in Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), pages 710-719, AAAI Press, 2004. [additional material on slides of KR'04 talk, 8 on 1]
• J. Rintanen, Phase transitions in classical planning: an experimental study, in Proceedings of the 14th International Conference on Automated Planning and Scheduling, pages 101-110, AAAI Press, 2004.
• J. Rintanen, Distance estimates for planning in the discrete belief space, in Proceedings of the 19th National Conference on Artificial Intelligence, pages 525-530, AAAI Press, 2004. (© 2004 American Association for Artificial Intelligence. All rights reserved. AAAI)
• B. Bonet and S. Thiébaux. GPT Meets PSR. 13th International Conference on Automated Planning and Scheduling (ICAPS-03), AAAI Press, Trento (Italy), June 2003. [ps.gz   pdf] © AAAI Press
• Botea A., Müller M., and Schaeffer J. 2003. Extending PDDL for Hierarchical Planning and Topological Abstraction. In Proceedings of the ICAPS-03 Workshop on PDDL, 25-32, Trento, Italy.
• Botea A. 2003. Reducing Planning Complexity with Topological Abstraction. In Proceedings of the ICAPS-03 Doctoral Consortium, 11-15, Trento, Italy.
• Buffet O., Dutech A. A Self-Made Agent Based on Action-Selection. Proceedings of the Sixth European Workshop on Reinforcement Learning (EWRL'03), Nancy, France, 2003. [ps.gz] [pdf]
• Buffet O., Dutech A., Charpillet F. Automatic Generation of an Agent's Basic Behaviors. Proceedings of the Second International Joint Conference on Autonomous Agents & Multi-Agent Systems (AAMAS'03), Melbourne, Australia, 2003. [ps.gz] [pdf]
• Dutech A., Buffet O. and Charpillet F. Apprentissage par renforcement pour la conception de systèmes multi-Agents réactifs. Actes des Journées Francophones sur les Systèmes Multi-Agents (JFSMA'03), Hammamet, Tunisie, 2003. [ps.gz] [pdf]
• C. Gretton, D. Price and S. Thiébaux. Implementation and Comparison of Solution Methods for Decision Processes with Non-Markovian Rewards. 19th Conference on Uncertainty in Artificial Intelligence (UAI-03), Morgan Kaufmann, Acapulco (Mexico), August 2003. [ps.gz   pdf] © the authors.
• Patrik Haslum and Ulrich Scholz, "Domain Knowledge in Planning: Representation and Use". In Proc. ICAPS 2003 Workshop on PDDL. (postscript/gzip).
• J. Rintanen, Symmetry reduction for SAT representations of transition systems, in Proceedings of the 13th International Conference on Automated Planning and Scheduling, pages 32-40, AAAI Press, 2003. (© 2003 American Association for Artificial Intelligence. All rights reserved. AAAI)
• J. Rintanen, Expressive equivalence of formalisms for planning with sensing, in Proceedings of the 13th International Conference on Automated Planning and Scheduling, pages 185-194, AAAI Press, 2003. (© 2003 American Association for Artificial Intelligence. All rights reserved. AAAI)
• Douglas Aberdeen and Jonathan Baxter (2002), Scaling Internal-State Policy-Gradient Methods for POMDPs. International Conference on Machine Learning. Sydney, Australia. 1--12 July 2002. [ ps.gz | pdf ]
• P. Bertoli, A. Cimatti, J. Slaney and S. Thiébaux. Solving Power Supply Restoration Problems with Planning via Symbolic Model-Checking. 15th European Conference on Artificial Intelligence (ECAI-02), pages 576-580, IOS Press, Lyon (France), July 2002. [pdf] © the authors
• Botea A., Müller M., and Schaeffer J. 2002. Using Abstraction for Planning in Sokoban. In Proceedings of the Third International Conference on Computer and Games CG-02, volume 2883 of Lecture Notes in Artificial Intelligence, 360-375, Edmonton, AB, Canada.
• Buffet O., Dutech A., Charpillet F. Learning to weigh basic behaviors in Scalable Agents. Proceedings of the First International Joint Conference on Autonomous Agents & Multi-Agent Systems (AAMAS'02), Bologna, Italy, 2002. [Poster presentation.] [ps.gz] [pdf]
• Buffet O., Dutech A., Charpillet F. Adaptive Combination of Behaviors in an Agent. Proceedings of the Fiveteenth European Conference on Artificial Intelligence (ECAI'02), Lyon, France, 2002. [ps.gz] [pdf]
• J. Rintanen, Backward plan construction for planning with partial observability, in International Conference on Artificial Intelligence Planning and Scheduling (AIPS02), M. Ghallab, J. Hertzberg and P. Traverso, eds., pages 173-182, AAAI Press, 2002. (© AAAI)
• S. Thiébaux, F. Kabanza and J. Slaney. Anytime State-Based Solution Methods for Decision Processes with Non-Markovian Rewards. 18th Conference on Uncertainty in Artificial Intelligence (UAI-02) pages 501-510, Morgan Kaufmann, Edmonton (Canada), July 2002. [ps.gz   pdf] © Morgan Kaufmann
• Buffet O., Dutech A. Looking for Scalable Agents. Proceedings of the Fifth European Workshop on Reinforcement Learning (EWRL'01), Utrecht, Netherland, 2001. [ps.gz] [pdf]
• Dutech A., Buffet O., Charpillet F. Multi-Agent Systems by Incremental Gradient Reinforcement Learning. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), Seattle, 2001. [pdf] [ps.gz]
• Buffet O., Dutech A., Charpillet F. Incremental Reinforcement Learning for designing Multi-Agent Systems. Proceedings of the Fifth International Conference on Autonomous Agents (Agents'01), Montréal, 2001. [Poster presentation.] [ps.gz] [pdf]
• Patrik Haslum and Hector Geffner, "Heuristic Planning with Time and Resources". In Proc. 6th European Conference on Planning, 2001. To appear in Lecture Notes in Artificial Intelligence, Springer Verlag (postscript/gzip, software).
• Patrik Haslum, "Models for Prediction". In Proc. IJCAI 2001 workshop on Planning under Uncertainty (postscript/gzip).
• J. Rintanen, Complexity of probabilistic planning under average rewards, in Proceedings of the 17th International Joint Conference on Artificial Intelligence, B. Nebel, ed., pages 503-508, August 2001. Morgan Kaufmann Publishers, San Francisco, California, 2001.
• J. Slaney and S. Thiébaux. Blocks World Revisited. Artificial Intelligence 125(1-2):119-153, Elsevier, January 2001. [pdf] © Elsevier
• S. Thiébaux and M.-O. Cordier. Supply Restoration in Power Distribution Systems -- A Benchmark for Planning under Uncertainty. 6th European Conference on Planning (ECP-01), pages 85-95, Springer Verlag, Toledo (Spain), September 2001. [ps.gz   pdf] © Springer
• Patrik Haslum and Hector Geffner, "Admissible Heuristics for Optimal Planning". In Proc. 5th International Conference on Artificial Intelligence Planning and Scheduling, 2000, p. 140 - 149. AAAI Press (postscript/gzip, software).
• Patrik Haslum and Peter Jonsson, "Planning with Reduced Operator Sets". In Proc. 5th International Conference on Artificial Intelligence Planning and Scheduling, 2000, p. 150 - 158. AAAI Press (postscript/gzip, software).
• Peter Jonsson, Patrik Haslum and Christer Bäckström, "Towards Efficient Universal Planning -- A Randomized Approach". Artificial Intelligence 117(1):1-29, 2000. (postscript/gzip, software).
• J. Rintanen. An iterative algorithm for synthesizing invariants, in Proceedings of the 17th National Conference on Artificial Intelligence / 12th Innovative Applications of AI Conference, pages 806-811, AAAI Press, 2000. (© AAAI)
• J. Rintanen. Incorporation of temporal logic control into plan operators, in ECAI 2000. Proceedings of the 14th European Conference on Artificial Intelligence, Werner Horn, ed., pages 526-530, IOS Press, Amsterdam, 2000.
• J. Rintanen and H. Jungholt. Numeric state variables in constraint-based planning, in Recent Advances in AI Planning: 5th European Conference on Planning, ECP'99, Durham, UK, September 8-10, 1999, S. Biundo and M. Fox, eds., Lecture Notes in Artificial Intelligence 1809, pages 109-121, 2000. Springer-Verlag, Berlin, Germany.
• Patrik Haslum and Peter Jonsson, "Some Results on the Complexity of Planning with Incomplete Information". In Proc. of the 5th European Conference on Planning, Lecture Notes in Artificial Intelligence vol. 1809, 1999, p. 308 - 318. Springer Verlag (preprint version, postscript/gzip).
• Patrik Haslum, "Model Checking by Random Walk". In Proc. 1999 ECSEL Workshop. (postscript/gzip, software).
• J. Rintanen. Constructing conditional plans by a theorem-prover, Journal of Artificial Intelligence Research, 10:323-352, 1999.
• J. Rintanen. A planning algorithm not based on directional search. in Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), A. G. Cohn, L. K. Schubert, and S. C. Shapiro, eds., pages 617-624, Trento, Italy, June 1998. Morgan Kaufmann Publishers, San Francisco, California.
• J. Rintanen. Lexicographic priorities in default logic. Artificial Intelligence Journal, 106(2):221-265, 1998.
• J. Rintanen. Complexity of prioritized default logics. Journal of Artificial Intelligence Research 9:423-461, 1998.
• J. Rintanen, Lexicographic Ordering as a Basis of Priorities in Default Reasoning, Department of Computer Science and Engineering, Helsinki University of Technology, December 1996, vi+187 pages.
• J. Slaney and S. Thiébaux. Linear-Time Near-Optimal Planning in the Blocks World. 13th American National Conference on Artificial Intelligence (AAAI-96), pages 1208-1214, AAAI Press/The MIT Press, Portland (OR), August 1996. [ps.gz] © AAAI Press More about the topic: see the Blocks World page
• J. Rintanen. On specificity in default logic. in Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 1974-1979, Montréal, Canada, August 1995, Morgan Kaufmann Publishers.
• S. Thiébaux, J. Hertzberg, W. Schoaff, and M. Schneider. A Stochastic Model of Actions and Plans for Anytime Planning under Uncertainty. International Journal of Intelligent Systems, 10(2):155-183, John Wiley, February 1995. [ps.gz] © John Wiley Short version: 2nd European Workshop on Planning (EWSP-93), pages 292-305, Vasdena (Sweden), IOS Press, December 1993. [ps.gz] © IOS Press
• I. Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. Journal of Applied Non-Classical Logics, 4(2):141-179, 1994.
• J. Hertzberg and S. Thiébaux. Turning an Action Formalism into a Planner. Journal of Logic and Computation, Special Issue on Actions and Processes, 4(5):617-654, Oxford University Press, October 1994. [ps.gz] © Oxford University Press Very short version: 8th International Symposium on Methodologies for Intelligent Systems (ISMIS-94), pages 305-314, Charlotte (NC), LNAI 869, October 1994. [ps.gz] © Springer
• J. Rintanen. Prioritized autoepistemic logic. in Logic in Artificial Intelligence: Proceedings of the 4th European Workshop JELIA'94, Lecture Notes in Artificial Intelligence 838, pages 232-246, York, England, September 1994. Springer-Verlag.
• I. Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. G. Lakemeyer and B. Nebel, Eds., Foundations of Knowledge Representation and Reasoning, Lecture Notes in Artificial Intelligence 810, pages 275-295. Springer-Verlag, June 1994.
• J. Rintanen. Approaches to priorities in default reasoning. M. Penttonen, ed., Proceedings of the Seventh Finnish Symposium on Computer Science, pages 121-131, Liperi, Finland, January 1994. University of Joensuu, Department of Computer Science. Report A-1994-1.
• S. Thiébaux and J. Hertzberg. A Semi-Reactive Planner Based on a Possible Models Action Formalization. 1st International Conference on AI Planning Systems (AIPS-92), pages 228-235, Morgan Kaufmann, College Park (MD), June 1992. [ps.gz] © Morgan Kaufmann
• I. Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. in Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR '92), B. Nebel, C. Rich and W. Swartout, eds., pages 627-638, Cambridge, Massachusetts, October 1992. Morgan Kaufmann Publishers.

Theses, Technical Reports and Other

• "Admissible Heuristics for Automated Planning". Doctoral Thesis no. 1004, Linköping University. 2006. (available from LiU E-press).
• Buffet O., Aberdeen D. Robust Probabilistic Temporal Planning: Dynamic Programming vs Policy Search National ICT Australia, september 2005. [ps.gz]
• A. Nareyek, R. Fourer, E. C. Freuder, E. Giunchiglia, R. P. Goldman, H. Kautz, J. Rintanen and A. Tate, Constraints and AI planning, IEEE Intelligent Systems, 20(2):62-72, 2005.
• Botea A., Enzenberger M., Müller M., and Schaeffer J. 2004. Macro-FF. In Booklet of 4th International Planning Competition, 15-17.
• Buffet O. Robust (L)RTDP: Reachability Analysis. National ICT Australia, december 2004. [pdf] [ps.gz]
• Buffet O., Aberdeen D. Planning with Robust (L)RTDP. National ICT Australia, november 2004. [pdf] [ps.gz]
• Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability, Report No. 198, Albert-Ludwigs-Universität Freiburg, Institut für Informatik, 2004.
• Jussi Rintanen. Conditional planning in the discrete belief space, Report No. 205, Albert-Ludwigs-Universität Freiburg, Institut für Informatik, 2004.
• Douglas Aberdeen (2003), A (Revised) Survey of Approximate Methods for Solving Partially Observable Markov Decision Processe Technical report, National ICT Australia, Canberra, Austalia. [ ps.gz | pdf ]
• Buffet O. Une double approche modulaire de l'apprentissage par renforcement pour des agents intelligents adaptatifs. Mémoire de thèse. 2003. [ps.gz] [pdf]
• Alain Dutech and Olivier Buffet (Eds) Proceedings of the Sixth European Workshop on Reinforcement Learning. 2003. [www]
• Botea A. 2002. Using Abstraction for Heuristic Search and Planning. Research Summary. In Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation SARA-02, volume 2371 of Lecture Notes in Artificial Intelligence, 326-327, Kananaskis, AB, Canada.
• Buffet O. Apprentissage par renforcement pour la conception de systèmes multi-Agents réactifs. Rapport d'avancement de thèse. 2002. [pdf] [ps.gz]
• D. Long, D. McDermott and S. Thiébaux editors. Proceedings of the ICAPS-03 Workshop on PDDL. Trento (Italy), June 2003. [pdf]
• F. Kabanza and S. Thiébaux editors. Proceedings of the AIPS-02 Workshop on Planning via Model-Checking. LAAS-CNRS, Toulouse (France), April 2002. [pdf]
• Douglas Aberdeen and Jonathan Baxter. Internal-State Policy-Gradient Algorithms for Inifinte-Horizon POMDPs Technical report, Research School of Information Science and Engineering, Australian National University, July 2001. [ ps.gz | pdf ] (Related movies: factory.mpg , heaven-hell.mpg )
• J. Rintanen and J. Hoffmann, An overview of recent algorithms for AI planning, Künstliche Intelligenz, (2):5-11, May 2001.
• Buffet O. Apprentissage par renforcement dans un système multi-agents. Mémoire de DEA. 2000. [pdf] [ps.gz]
• J. Rintanen. Priorities and nonmonotonic reasoning. Research report A 28, Helsinki University of Technology, Digital Systems Laboratory, December 1993, 90 pages.
• J. Rintanen. Stratification and tractability in nonmonotonic reasoning. Research report A 20, Helsinki University of Technology, Digital Systems Laboratory, November 1992, 71 pages.
• I. Niemelä and J. Rintanen. A decision procedure for stratified autoepistemic logic. E. Hyvönen, J. Seppänen and M. Syrjänen, Eds., 5th Finnish Artificial Intelligence Conference, Vol 1: Conference Papers, pages 202-211, June 1992.
• J. Rintanen, M. Tamminen, J. Arkko, J. Kuusela, E. Nuutila and V. Hirvisalo. XD manual. Report C 36, Helsinki University of Technology, Faculty of Information Technology, Espoo, 1989.

Optimization/Other

Journal, Conference and Workshop Papers

• Jinbo Huang. The Effect of Restarts on the Efficiency of Clause Learning. AAAI-06 Workshop on Learning for Search.
• Jinbo Huang, Mark Chavira, and Adnan Darwiche. Solving MAP Exactly by Searching on Compiled Arithmetic Circuits. Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-06).
• Philip Kilby, John Slaney, Sylvie Thiébaux, and Toby Walsh. Estimating search tree size.
  In Proceedings, 21st National Conference on AI AAAI-06. AAAI Press, 2006.
• Philip Kilby, John Slaney, Sylvie Thiébaux, and Toby Walsh. Estimating search tree size. In Proceedings, Workshop on Learning for Search, 21st National Conference on AI AAAI-06. AAAI Press, 2006.
• J. Rintanen, Compact representation of sets of binary constraints, ECAI 2006. Proceedings of the 17th European Conference on Artificial Intelligence, IOS Press, 2006. to appear
• Jinbo Huang and Adnan Darwiche. DPLL with a Trace: From SAT to Knowledge Compilation. Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pages 156–162. [PDF] [PS]
• Philip Kilby, John Slaney, Sylvie Thiébaux, and Toby Walsh. The backbone of the travelling salesperson. In Proceedings, Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, 2005.
• Philip Kilby, John Slaney, and Toby Walsh. Backbones and backdoors in satisfiability (also a poster) In Proceedings, 20th National Conference on AI AAAI-05, pages 1368-1373. AAAI Press, 2005.
• Jinbo Huang and Adnan Darwiche. Toward Good Elimination Orders for Symbolic SAT Solving. Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-04), pages 566–573. [PDF]
• Jinbo Huang and Adnan Darwiche. Using DPLL for Efficient OBDD Construction. SAT 2004, Selected and Revised Papers, Lecture Notes in Computer Science 3542, pages 157–172. An earlier version appears in Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT-04), pages 127–136. [PDF] [PS]
• Buffet O., Muller Y. Nidification hivernale de la chouette hulotte (strix haluco) en Lorraine. CICONIA 27 (3), 2003, pp 129-130.
• Jinbo Huang and Adnan Darwiche. A Structure-based Variable Ordering Heuristic for SAT. Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pages 1167–1172. [PDF] [PS] [Software]
• P.-Y. Glorennec and A. Grastien, Application d'arbres de régression flous à la prévision des pics de pollution, 34iemes Journées de Statistique ({JDS}'02), pp. 233-234, 2002, French
• Douglas Aberdeen and Jonathan Baxter (2001), Emmerald: A fast matrix-matrix multiply using Intel SIMD technology. Concurrency and Computation: Practice and Experience, 13:103--119, 2001. [ ps.gz ]
• S. Dunstall, A. Ernst, H. Jiang, P. Kilby, and M. Krishnamoorthy. Locomotive rostering with multiple locomotive classes and a central depot. In Proceedings of the 16th National Conference of the Australian Society for Operations Research, McLaren Vale, South Australia, 2001. ASOR, 2001.
• H. Jiang, P. Kilby, and M Westcott. Making the most from your market. In Proceedings of the 16th National Conference of the Australian Society for Operations Research. ASOR, 2001. Winner, Best Paper award.
• Philip Kilby. The augmented regret heuristic for staff scheduling. In Proceedings of the 16th National Conference of the Australian Society for Operations Research, McLaren Vale, South Australia, 2001. ASOR, 2001.
• J. Rintanen, Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae, in International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR01), R. Nieuwenhuis and A. Voronkov, eds., Lecture Notes in Computer Science 2250, pages 362-376, Springer-Verlag, 2001. (© Springer-Verlag)
• Douglas Aberdeen, Jonathan Baxter, and R. Edwards (2000), 92 c /MFlop/s, Ultra-Large-Scale Neural-Network training on a PIII cluster. In Proceedings of Super Computing 2000, Dallas, TX., November 2000. SC2000 CDROM. [ pdf ]
• Douglas Aberdeen and Jonathan Baxter (2000), General matrix-matrix multiplication using SIMD features of the PIII. In A. Bode, T. Ludwig, and R. Wism"uller, editors, Euro-Par 2000: Parallel Processing. RSISE, Australian National University, Springer--Verlag, August 2000. [ ps.gz ]
• Bruno De Backer, Vincent Furnon, Patrick Prosser, Philip Kilby, and Paul Shaw. Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics, 6(4):501-523, 2000.
• Philip Kilby, Patrick Prosser, and Paul Shaw. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints, 5(4):389-414, 2000.
• John K. Slaney, Sylvie Thiébaux, and Philip Kilby. Estimating the hardness of optimisation. In Werner Horn, editor, ECAI 2000, Proceedings of the 14th European Conference on Artificial Intelligence, Berlin, Germany, August 20-25, 2000, pages 123-130. IOS Press, 2000. [ps.gz]
• S. Thiébaux and P. Lamb. Combining Kalman filtering and Markov localization in network-like environments. 6th Pacific-Rim International Conference on Artificial Intelligence (PRICAI-2000), pages 756-766, LNAI, Springer Verlag, Melbourne (Australia), August 2000. [ps.gz] © Springer
• Philip Kilby, Patrick Prosser, and Paul Shaw. Guided local search for the vehicle routing problem. In Stefan Voss, Silvano Martello, Ibrahim H. Osman, and Catherine Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 473-486. Kluwer Academic Publishers, 1999.
• J. Rintanen. Improvements to the evaluation of quantified Boolean formulae, in Proceedings of the 16th International Joint Conference on Artificial Intelligence, T. Dean, ed., pages 1192-1197, Stockholm, Sweden, August 1999. Morgan Kaufmann Publishers, San Francisco, California.
• S. Thiébaux and P. Lamb. Vehicle Location as State Estimation in a Switching Environment. 9th International Conference on Advanced Robotics (ICAR-99), JARA, Tokyo (Japan), October 1999.
• P.J. Kilby, P. Prosser, and P. Shaw. Generating solutions for real-world vehicle routing problems. In Proceedings INFORMS 1998. INFORMS, 1998.
• Philip Kilby, Patrick Prosser, and Paul Shaw. Guided local search for the vehicle routing problem. In Proceedings of the 2nd International Conference on Metaheuristics. INRIA, France, 1998.
• P. Lamb and S. Thiébaux. Avoiding Explicit Map-Matching in Vehicle Location. 6th ITS World Congress (ITS-99), Toronto (Canada), November 1999. [msword]
• S. Thiébaux, P. Lamb, and B. Robinson. Updating Turn Probabilities at Intersections in Response to Traffic Incidents. 4th International Conference of ITS Australia (ITSA-99), Adelaide (Australia), May 1999. [ps.gz   pdf] Extended (but older) version:Technical Report CMIS 98/140, CSIRO Math. & Info. Sc., Canberra (Australia), July 1998. [ps.gz] © CSIRO
• J. Slaney and S. Thiébaux. On the Hardness of Decision and Optimisation Problems. 13th European Conference on Artificial Intelligence (ECAI-98), pages 244-248, John Wiley, Brighton (UK), August 1998. [ps.gz] © John Wiley
• B. DeBaker, V. Furnon, P.J. Kilby, P. Prosser, and P. Shaw. Local search in constraint programming: Application to the vehicle routing problem. In Proceedings of CP97 Workshop on Industrial Constraint-Directed Scheduling, pages 1-15, 1997.
• P. Kilby, P. Lamb, J. Smith, P. Morriss, M. Horn, I. Mathiesson, and N. Nguyen. Tritram: Traffic simulation with adaptive control and mixed micro/macro levels. In M.H. Hamza, editor, Proceedings of the IASTED International Conference Modelling, Simulation and Optimizaiton. IASTED, IASTED, 1996. May 6-9 1996. Gold Coast Australia. Published on CD-ROM.
• D.J. Abel, P.J. Kilby, and J.R. Davis. The systems integration problem. International Journal of Geographical Information Systems, 8(1):1-12, 1994.
• M. A. Forbes J. N. Holt, P. J. Kilby, and A. M. Watts. BUDI: A software system for bus dispatching. J. Opl. Res. Soc., 45(5):497-508, 1994.
• M.A. Forbes, J.N. Holt, P.J. Kilby, and A.M. Watts. A matching algorithm with applications to bus operations. Australasian Journal of Combinatorics, 4:71-85, 1991.

Theses, Technical Reports and Other

• Philip Kilby. An online schedule update algorithm for vehicle fleets. CMIS Technical Report 04/17, CSIRO Mathematical and Information Sciences, GPO Box 664, Canberra ACT 2601, Australia, 2004.
• Douglas Aberdeen, Ph.D Thesis, Policy-Gradient Algorithms for Partially Observable Markov Decision Processes, March 2003. [ ps.gz | pdf ]
• Douglas Aberdeen (2001), A Survey of Discriminatory and Connectionist Speech Processing Technical report, Research School of Information Science and Engineering, Australian National University, Canberra, Austalia. [ ps.gz | pdf ]
• Philip Kilby and Paul Thomas. RTSim transit simulator: Configuration. Technical Report CMIS 2000/20, CSIRO Mathematical and Information Sciences, Canberra, Australia, 2000.
• Philip Kilby and Paul Thomas. RTSim transit simulator: User interface. Technical Report CMIS 2000/19, CSIRO Mathematical and Information Sciences, Canberra, Australia, 2000.
• Philip Kilby and Paul Thomas. RTSim transit simulator: System description. Technical Report CMIS 99/151, CSIRO Mathematical and Information Sciences, Canberra, Australia, 1999.
• Philip Kilby and Peter Lamb. RTSim transit simulator: Technical description. Technical Report CMIS 99/152, CSIRO Mathematical and Information Sciences, Canberra, Australia, 1999.
• Douglas Aberdeen and Allen Weeks (1998), The 4-th Umpire. Thesis submitted in partial fulfillment of requirements for Bachelor of Engineering, University of Melbourne. November 1998. [ ps.gz | pdf ]
• P. Kilby, P. Prosser, and P. Shaw. Dynamic VRPs: A study of scenarios. APES Technical Report APES-06-1998, Department of Computer Science, Strathclyde University, Glasgow, Scotland, September 1998.
• P. Kilby, P. Prosser, and P. Shaw. Implementation of LNS for constrained VRPs. APES Technical Report APES-01-1998, Department of Computer Science, Strathclyde University, Glasgow, Scotland, April 1998.
• Philip Kilby. Comparison of two traffic analysis systems: Tritram and sidra. Technical report, CSIRO Mathematical and Information Sciences, PO Box 664 Canberra ACT 2601, 1997.
• Philip Kilby. Optimization-Based Heuristics for Vehicle Routing and Scheduling. PhD thesis, Department of Mathematics, University of Queensland, Queensland, Australia, November 1991.