I. Miguel. Dynamic Flexible Constraint Satisfaction and its Application to AI Planning. Springer Distinguished Dissertations Series, 2004. 
I. Miguel, W. Ruml. Proceedings of the Seventh International Symposium on Abstraction, Reformulation and Approximation, Whistler, Canada, Springer LNCS 4612, 2007.  
I. Miguel, S. Prestwich. Proceedings of the Fifth International Workshop on Constraint Modelling and Reformulation, Nantes, France, 2006.  
A.M. Frisch, I. Miguel. Proceedings of the Third International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Toronto, Canada, 2004. 
A.M. Frisch, I. Miguel. Special Issue on Abstraction and Automation in Constraint Modelling, Constraints 13 (3), 2008 
I. Miguel, S. Prestwich (eds). Constraint Modelling and Reformulation. In F. Benhamou, N. Jussien, B. O'Sullivan (eds), Trends in Constraint Programming, iSTE, 2007.  
K.N. Brown, I. Miguel. Uncertainty and Change. in F. Rossi, P. van Beek, T. Walsh (eds), The Handbook of Constraint Programming, 2006. 
B. Varghese, O. Akgun, I. Miguel, L. Thai, A. Barker Cloud Benchmarking For Maximising Performance of Scientific Applications. IEEE Transactions on Cloud Computing (to appear), 2016.  
I. P. Gent, C. Jefferson, S. Linton, I. Miguel, P. Nightingale. Generating Custom Propagators for Arbitrary Constraints. Artificial Intelligence 211, 133, 2014.  
T. W. Kelsey, L. Kotthoff, C. A. Jefferson, S. A. Linton, I. Miguel, P. Nightingale, I. P. Gent. Qualitative Modelling via Constraint Programming. Constraints 19(2), 163173, 2014.  
P. Nightingale, I.P. Gent, C. Jefferson, I. Miguel. Short and Long Supports for Constraint Propagation. Journal of Artificial Intelligence Research 46, 145, 2013.  
I.P. Gent, I. Miguel, N.C.A. Moore. An empirical study of learning and forgetting constraints. AI Communications 25(2), 191208, 2012.  
L. Kotthoff, I.P. Gent, I. Miguel. An Evaluation of Machine Learning in Algorithm Selection for Search Problems. AI Communications 25(3), 257270, 2012.  
A. Grayland, C. Jefferson, I. Miguel, C. RoneyDougal. Minimal Ordering Constraints for some Families of Variable Symmetries. Annals of Mathematics and Artificial Intelligence 57(1), 75102, 2009.  
Z. Kiziltan, A.M. Frisch, B. Hnich, I. Miguel, T. Walsh. Filtering Algorithms for the Multiset Ordering Constraints. Artificial Intelligence 173(2), 299328, 2009.  
A.M. Frisch, W. Harvey, C. Jefferson, B. MartinezHernandez, I. Miguel. Essence: A Constraint Language for Specifying Combinatorial Problems. Constraints 13(3), 268306, 2008.  
I.P. Gent, I. Miguel, P. Nightingale. Generalised arc consistency for the AllDifferent constraint: An empirical survey. Artificial Intelligence 172(18), 19732000, 2008. Errata for this paper.  
I.P. Gent, C. Jefferson, T. Kelsey, I. Lynce, I. Miguel, P. Nightingale, B.M. Smith. Search in the Patience Game "Black Hole". (Preprint). AI Communications 20(3), 211226, 2007.  
A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Propagation Algorithms for Lexicographic Ordering Constraints. Artificial Intelligence 170(10), 803834, 2006.  
C. Jefferson, A. Miguel, I. Miguel, A. Tarim. Modelling and Solving English Peg Solitaire. Computers and Operations Research 33(10), pages 29352959, 2006.  
I. Miguel, and Q. Shen. Exhibiting the Behaviour of TimeDelayed Systems via an Extension to Qualitative Simulation IEEE Transactions on Systems, Man and Cybernetics (Part A) 35(2), pages 298305, 2005.  
B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Hybrid Modelling for Robust Solving. Annals of Operations Research 130 (14), pages 1939, 2004.  
I. Miguel and Q. Shen. Fuzzy rrDFCSP and Planning. Artificial Intelligence 148 (12), pages 1152, 2003.  
I. Miguel, Q. Shen and P.Jarvis. Efficient Flexible Planning via Dynamic Flexible Constraint Satisfaction. Engineering Applications of Artificial Intelligence, 14(3), pages 301327, 2001. bibtex  
I. Miguel and Q. Shen. Solution Techniques for Constraint Satisfaction Problems: Foundations. Artificial Intelligence Review, 15(4), pages 243267, 2001. bibtex  
I. Miguel and Q. Shen. Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches. Artificial Intelligence Review, 15(4), pages 269293, 2001. bibtex  
I. Miguel and Q. Shen. Dynamic Flexible Constraint Satisfaction. Applied Intelligence, 13(3), pages 231245, 2000. bibtex  
I. Miguel and Q. Shen. Hard, Flexible and Dynamic Constraint Satisfaction. Knowledge Engineering Review, 14(3), pages 199220, 1999. bibtex 
O. Akgun, I.P. Gent, C. Jefferson, I. Miguel, and P. Nightingale. Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT. Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP), 312, 2016  
P. Nightingale, P. Spracklen, I. Miguel. Automatically Improving SAT Encoding of Constraint Problems through Common Subexpression Elimination in Savile Row Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP), 330340, 2015  
J. Wetter, O. Akgun, A. Barker, M. Dominik, I. Miguel, B. Varghese. Cloudbased EInfrastructure for Scheduling Astronomical Observations. Proceedings of the 11th IEEE International Conference on eScience (eScience), 362370, 2015  
J. Wetter, O. Akgun, I. Miguel. Automatically Generating Streamlined Constraint Models with Essence and Conjure Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP), 480496, 2015  
O. Akgun, I. P. Gent, C. Jefferson, I. Miguel, P. Nightingale. Breaking Conditional Symmetry in Automated Constraint Modelling with Conjure. Proceedings of the 21st European Conference on Artificial Intelligence (ECAI), 38, 2014  
I. P. Gent, B. S. Hussain, C. Jefferson, L. Kotthoff, I. Miguel, G. F. Nightingale, P. Nightingale. Discriminating Instance Generation for Automated Constraint Model Selection. Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), 356365, 2014  
P. Nightingale, O. Akgun, I. P. Gent, C. Jefferson, I. Miguel. Automatically Improving Constraint Models in Savile Row through Associative Commutative Common Subexpression Elimination. Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP), 590605, 2014  
O. Akgun, A. M. Frisch, I. P. Gent, B. S. Hussain, C. Jefferson, L. Kotthoff, I. Miguel, P. Nightingale. Automated Symmetry Breaking and Model Selection in Conjure. Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (CP), 107116, 2013  
D. Balasubramaniam, C. Jefferson, L. Kotthoff, I. Miguel, P. Nightingale. An automated approach to generating efficient constraint solvers. Proceedings of the 34th International Conference on Software Engineering (ICSE), 661671, 2012  
O. Akgun, A. M. Frisch, B. Hnich, C. Jefferson, I. Miguel. Extensible Automated Constraint Modelling. Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI), 2011.  
D. Balasubramaniam, L. de Silva, C. Jefferson, L. Kotthoff, I. Miguel, P. Nightingale. Dominion: an Architecturedriven Approach to Generating Efficient Constraint Solvers. Proceedings of the 9th Working IEEE/IFP Conference on Software Architecture (WICSA), 2011  
P. Nightingale, I. P. Gent, C. Jefferson, I. Miguel. Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints. Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 2011  
I.P. Gent, C. Jefferson, L. Kotthoff, I. Miguel, N. Moore, P. Nightingale, K. Petrie. Learning when to use Learning in Constraint Solving. Proceedings of the 19th European Conference on Artificial Intelligence (ECAI), 873878, 2010  
I.P. Gent, C. Jefferson, I. Miguel, P. Nightingale. Generating Specialpurpose Stateless Propagators for Arbitrary Constraints. Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP), 206220, 2010  
L. Kotthoff, I. Miguel, P. Nightingale. Ensemble Classification for Constraint Solver Learning. Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP), 321329, 2010  
S. Huczynska, P. McKay, I. Miguel, P. Nightingale. Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics. Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, 5064, 2009  
A. Grayland, I. Miguel, C.M. RoneyDougal. Snake Lex: An Alternative to Double Lex. Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, 391399, 2009  
A.M. Frisch, M. Grum, C. Jefferson, B. MartinezHernandez, I. Miguel. The Design of Essence: A Constraint Language for Specifying Combinatorial Problems. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, 8087, 2007.  
A.M. Frisch, C. Jefferson, B. MartinezHernandez, I. Miguel. Symmetry in the Generation of Constraint Models. Proceedings of the International Symmetry Conference, 2007.  
I.P. Gent, C. Jefferson, I. Miguel, P. Nightingale. Data Structures for Generalised Arc Consistency for Extensional Constraints. Proceedings of the Twenty Second Conference on Artificial Intelligence, 191197, 2007.  
A. Grayland, I. Miguel, C. RoneyDougal. Rule 1,2Minimal Ordering Constraints for some Families of Variable Symmetries. Proceedings of the International Symmetry Conference, 2007.  
J. Charnley, S. Colton, I. Miguel. Automatic Generation of Implied Constraints. Proceedings of the Seventeenth European Conference on Artificial Intelligence, 7377, 2006.  
I.P. Gent, C. Jefferson, I. Miguel. Minion: A Fast, Scalable Constraint Solver. Proceedings of the Seventeenth European Conference on Artificial Intelligence, 98102, 2006. This was judged by the chairs to be one of the ten best papers submitted to the conference. Click for more information on the Minion Constraint Solver.  
I.P. Gent, C. Jefferson, I. Miguel. Watched Literals for Constraint Propagation in Minion. Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming, 182197, 2006.  
M. Bartlett, A.M. Frisch, Y. Hamadi, I. Miguel, S.A. Tarim, C. Unsworth. The Temporal Knapsack Problem and Its Solution. Proceedings of the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), 3448, 2005.  
A.M. Frisch, C. Jefferson, B. MartinezHernandez, I. Miguel. The Rules of Constraint Modelling. Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 109116, 2005.  
I.P. Gent, T. Kelsey, S.A. Linton, I. McDonald, I. Miguel, B.M. Smith. Conditional Symmetry Breaking. Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP), 256270, 2005.  
A.M. Frisch, C. Jefferson, I. Miguel. Symmetry breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern. Proceedings of the 16th European Conference on Artificial Intelligence, pages 171175, 2004.  
S.A. Tarim, I. Miguel. Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the WagnerWhitin Problem. Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR), LNCS 3011, 2004. You may find this powerpoint presentation useful.  
A.M. Frisch, C. Jefferson, I. Miguel. Constraints for Breaking More Row and Column Symmetries. Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming, pp. 318332, LNCS 2833, 2003.  
A.M. Frisch, I. Miguel, Z. Kiziltan, B. Hnich, T. Walsh. Multiset Ordering Constraints. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 221226, 2003.  
P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, T. Walsh. Breaking Row and Column Symmetries in Matrix Models. Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, pages 462476, LNCS 2470, 2002. bibtex  
A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Global Constraints for Lexicographic Orderings (pdf). Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, pages 93108, LNCS 2470, 2002. bibtex. There is also a longer technical report.  
S. Colton and I. Miguel. Constraint Generation via Automated Theory Formation. Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, pages 575579, LNCS 2239, 2001. bibtex. There is also a longer technical report.  
I. Miguel, P. Jarvis, Q. Shen. Flexible Graphplan. Proceedings of the Fourteenth European Conference on Artificial Intelligence, pages 506510, 2000. bibtex  
I. Miguel and Q. Shen. Extending FCSP to Support Dynamically Changing Problems. Proceedings of the Eighth International Conference on Fuzzy Systems, pages 16151620, 1999. bibtex 
L. Kotthoff, I. P. Gent, I. Miguel. A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. Proceedings of the 4th Annual Symposium on Combinatorial Search (SOCS), 8491, 2011. Won the Best Student Paper prize.  
N.C.A. Moore, I.P. Gent, I. Miguel. Lazy Explanations for Constraint Propagators. Proceedings of the Twelfth International Symposium on Practical Aspects of Declarative Languages (PADL), 217233, 2010.  
I. P. Gent, S. Huczynska, P. McKay, I. Miguel, P. Nightingale.
Modelling Equidistant Frequency Permutation Arrays in Constraints.
Proceedings of the Eighth International Symposium on Abstraction,
Reformulation and Approximation (SARA), 2009.
(NB This paper is superseded by the CP paper with a similar title above). 

A. Grayland, I. Miguel, C. M. RoneyDougal. Confluence of reduction rules for lexicographic ordering constraints. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 2009.  
A. Grayland, I. Miguel, C. M. RoneyDougal.
In search of a better method to break row and column symmetries
Proceedings of the Eighth International Symposium on Abstraction,
Reformulation and Approximation (SARA), 2009.
(NB This paper is superseded by the CP paper on Snake Lex above). 

A. Rendl, I. Miguel, I. P. Gent, P. Gregory. Common Subexpressions in Constraint Models of Planning Problems. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 128135, AAAI Press, 2009.  
A. Rendl, I. Miguel, I. P. Gent, C. Jefferson. Automatically Enhancing Constraint Model Instances during Tailoring. Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA), 120127, AAAI Press, 2009.  
I.P. Gent, I. Miguel, A. Rendl. Tailoring Solverindependent Constraint Models: A Case Study with Essence' and Minion. Proceedings of the Seventh International Symposium on Abstraction, Reformulation and Approximation (SARA), 184199, Springer LNCS 4612, 2007.  
A.M. Frisch, B. Hnich, I. Miguel, B.M. Smith, T. Walsh. Transforming and Refining Abstract Constraint Specifications. Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation (SARA), LNAI 3607, 7691, 2005.  
A. M. Frisch, I. Miguel, T. Walsh. Extensions to Proof Planning for Generating Implied Constraints. Proceedings of the Ninth Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 01), pages 130141, 2001. bibtex 
I.P. Gent, I. Miguel, A. Rendl. Optimising Quantified Expressions in Constraint Models. Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation (ModRef), 2010.  
O. Akgun, A.M. Frisch, B. Hnich, C. Jefferson, I. Miguel. Conjure Revisited: Towards Automated Constraint Modelling. Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation (ModRef), 2010.  
I.P. Gent, I. Miguel, A. Rendl. Optimising Quantified Expressions in Constraint Models. Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation (ModRef), 2010.  
A. Rendl, I. Miguel, I.P. Gent. The Cost of Flattening with Common Subexpression Elimination. Proceedings of the Eighth International Workshop on Constraint Modelling and Reformulation, 117131, 2009.  
I.P. Gent, I. Miguel, A. Rendl Common Subexpression Elimination in Automated Constraint Modelling. Proceedings of the International Workshop on Modeling and Solving Problems with Constraints, 2008.  
A. Grayland, I. Miguel, C. RoneyDougal. Confluence of Reduction Rules for Lexicographic Ordering Constraints. Proceedings of the International Workshop on Symmetry and Constraint Satisfaction Problems, 2008.  
A. Grayland, I. Miguel, C. RoneyDougal Minimal Ordering Constraints for some Families of Variable Symmetries. Proceedings of the 7th International Workshop on Symmetry and Constraint Satisfaction Problems, 2007.  
A.M. Frisch, M. Grum, C. Jefferson, B. MartinezHernandez, I. Miguel Why ESSENCE? Frequently Asked Questions about a New Language for Specifying Combinatorial Problems. Proceedings of the 5th International Workshop on Constraint Modelling and Reformulation, 3041, 2006.  
A.M. Frisch, M. Grum, C. Jefferson, B. MartinezHernandez, I. Miguel The Essence of ESSENCE: A Constraint Language for Specifying Combinatorial Problems. Proceedings of the 4th International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 7388, 2005.  
A.M. Frisch, C. Jefferson, B. MartinezHernandez, I. Miguel The Rules of Constraint Modelling: An Overview. Proceedings of the 12th Workshop on Automnated Reasoning, 2005.  
S.A. Tarim, I. Miguel A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse. Proceedings of the CSCLP 2005: Joint Annual Workshop on ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 148162, 2005.  
A.M. Frisch, C. Jefferson, B. MartinezHernandez, I. Miguel Generating Effective Constraint Programs: An Application of Automated Reasoning. Proceedings of the 11th Workshop on Automated Reasoning, 2004.  
A.M. Frisch, C. Jefferson, B. MartinezHernandez, I. Miguel The Rules of Modelling: Towards Automatic Generation of Constraint Programs. Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 2004.  
I.P. Gent, I. McDonald, I. Miguel, B.M. Smith. Approaches to Conditional Symmetry Breaking. Proceedings of the 4th International Workshop on Symmetry and Constraint Satisfaction Problems, 2004.  
A. Bakewell, A.M. Frisch, I. Miguel, Towards Automatic Modelling of Constraint Satisfaction Problems: A System Based on Compositional Refinement. Proceedings of the 2nd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pages 217, 2003.  
P. Flener, A.M. Frisch, B. Hnich, C. Jefferson, Z.Kiziltan, I. Miguel, J. Pearson, T. Walsh. Breaking Symmetries in Matrix Models: A Brief Overview. Proceedings of the Tenth Workshop on Automated Reasoning, pages 2728, 2003.  
A.M. Frisch, I. Miguel, T. Walsh. Refining Abstract Specifications of Constraint Satisfaction Problems. Proceedings of the Tenth Workshop on Automated Reasoning, pages 2931, 2003.  
C. Jefferson, A. Miguel, I. Miguel, A. Tarim. Modelling and Solving English Peg Solitaire. Proceedings of the Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pages 261275, 2003. You might find this powerpoint presentation useful. Some Ilog Solver code and a PDDL specification can be found here.  
P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel and T. Walsh. Matrix Modelling: Exploiting Common Patterns in Constraint Programming. Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, pages 2741, 2002. bibtex  
A. M. Frisch, B. Hnich, I. Miguel, B.M. Smith, T. Walsh. Towards CSP Model Reformulation at Multiple Levels of Abstraction. Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, pages 4256, 2002. bibtex  
A. M. Frisch, I. Miguel, T. Walsh. Automatically Transforming Constraint Satisfaction Problems: Further Progress. Proceedings of the 9th Workshop on Automated Reasoning, 2002. bibtex  
A. M. Frisch, I. Miguel, T. Walsh. CGRASS: A System for Transforming Constraint Satisfaction Problems. Proceedings of the ERCIM/Colognet Workshop on Constraint Solving and Constraint Logic Programming LNAI 2627, pages 1530, 2002. bibtex  
I. Miguel, Q. Shen, P. Jarvis. Flexible Planning by Leximin Fuzzy Constraint Satisfaction. Proceedings of the Fourth International Workshop on Soft Constraints pages 4355, 2002. bibtex  
S. Colton, L. Drake, A. M. Frisch, I. Miguel and T. Walsh. Automatic Generation of Implied Constraints: Initial Progress. Proceedings of the 8th Workshop on Automated Reasoning, pages 1718, 2001. bibtex  
P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson and T. Walsh. Symmetry in Matrix Models. Proceedings of the CP'01 Workshop on Symmetry in Constraints (SymCon '01), pages 4148, 2001. bibtex  
P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel and T. Walsh. Matrix Modelling. Proceedings of the CP'01 Workshop on Modelling and Problem Formulation (Formul '01), pages 17, 2001. bibtex  
A. M. Frisch, I. Miguel, T. Walsh. Generating Implied Constraints via Proof Planning. Proceedings of the IJCAR01 Workshop on Future Directions in Automated Reasoning, pages 4855, 2001. bibtex  
A. M. Frisch, I. Miguel, T. Walsh. Modelling a Steel Mill Slab Design Problem. Proceedings of the IJCAI01 Workshop on Modelling and Solving Problems with Constraints, pages 3945, 2001. bibtex  
A. M. Frisch, I. Miguel, T. Walsh. Symmetry and Implied Constraints in the Steel Mill Slab Design Problem. Proceedings of the CP'01 Workshop on Modelling and Problem Formulation (Formul'01), pages 815, 2001. bibtex  
I. Miguel. Symmetrybreaking in Planning: Schematic Constraints. Proceedings of the CP'01 Workshop on Symmetry in Constraints (SymCon '01), pages 1724, 2001. bibtex  
I. Miguel. The Case for Dynamic Flexible Constraint Satisfaction. Proceedings of the CP'01 Workshop on Constraints and Uncertainty, pages 1920, 2001. bibtex  
P. Jarvis, I. Miguel, Q. Shen. Flexible Blackbox: Preliminary Results. Proceedings of the AAAI2000 Workshop on Representational Issues for RealWorld Planning Systems, pages 4349, 2000. bibtex  
I. Miguel and Q. Shen. Extending Qualitative Modelling for Simulation of TimeDelayed Behaviour. Proceedings of the Twelfth International Workshop on Qualitative Reasoning, Cape Cod, Massachusetts, pages 161166, 1998. bibtex 
I. Miguel. Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning. PhD Thesis, University of Edinburgh, 2001. You might find this powerpoint presentation useful.  
I. Miguel. Simulating Inverse Responses and Timedelayed Behaviour with Fuzzy Qualitative Simulation. MSc Thesis, University of Edinburgh, 1997. 
Page maintained by Ian Miguel (email me). Last update: 29th September, 2016.