Dr John Slaney
MA *Cambridge*, PhD *ANU*
Professor
ANU College of Engineering and Computer Science
T:
6267 6283 / 6125 8607
Areas of expertise
- Combinatorics And Discrete Mathematics (Excl. Physical Combinatorics) 010104
- Optimisation 010303
- Computational Logic And Formal Languages 080203
- Mathematical Logic, Set Theory, Lattices And Universal Algebra 010107
- Artificial Intelligence And Image Processing 0801
Research interests
- Logic, especially nonclassical logics
- Automated reasoning
- Artificial Intelligence, especially constraint satisfaction, search and planning
Biography
I was born in England but escaped, taught logic in philosophy departments for several years, escaped again and moved to Canberra in 1988 where I have been automating reasoning ever since.
I like doing this. The ANU is an idyllic place to be a researcher, Canberra is a better city to live in than you would believe from listening to Australians from anywhere else, and I actually get paid for thinking about logic and hacking code! That's as good as it gets.
Other likes: travel, good food (enthusiastic but inexpert cook), classical music (ditto pianist).
Dislikes: no really interesting ones (sorry).
Publications
- Slaney, J & Woltzenlogel Paleo, B 2017, 'Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning', Journal of Automated Reasoning, pp. 24pp (online).
- Itegulov, D, Slaney, J & Woltzenlogel Paleo, B 2017, 'Scavenger 0.1: A Theorem Prover Based on Conflict Resolution', 26th International Conference on Automated Deduction, CADE-26 2017, ed. Leonardo de Moura, Springer International Publishing AG, Switzerland, pp. 345-356pp.
- Slaney, J & Woltzenlogel Paleo, B 2017, 'Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning', Journal of Automated Reasoning, vol. 60, no. 2, p. 24.
- Slaney, J 2015, 'Logic Considered Fun', Fourth International Conference on Tools for Teaching Logic 2015, ed. M. Antonia Huertas, Joao Marcos, Maria Manzano, Sophie Pinchinat, University of Rennes, France, pp. 215-222.
- Slaney, J 2014, 'Set-theoretic duality: A fundamental feature of combinatorial optimisation', 21st European Conference on Artificial Intelligence ECAI 2014, ed. T. Schaub, G. Friedrich, B. O'Sullivan, IOS Press, online, pp. 843 - 848.
- Slaney, J & Walker, E 2014, 'The One-Variable Fragment of T-arrow’', Journal of Philosophical Logic, vol. 43, no. 5, pp. 867-878.
- Thiebaux, S, Coffrin, C, Hijazi, H et al 2013, 'Planning with MIP for Supply Restoration in Power Distribution Systems', 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, AAAI Press, USA, pp. 2900-2907.
- Beall, J, Beall, J, Brady, R et al 2012, 'On the Ternary Relation and Conditionality', Journal of Philosophical Logic, vol. 41, no. 3, pp. 595-612.
- Slaney, J 2012, 'Visualising Reasoning: What ATP Can Learn From CP', Electronic Notes in Theoretical Computer Science, vol. 285, no. 57-70, pp. 57-70.
- Haslum, P, Slaney, J & Thiebaux, S 2011, 'Incremental Lower Bounds for Additive Cost Planning Problems', ICAPS'11 workshop on Heuristics for Domain-Independent Planning.
- Haslum, P, Slaney, J & Thiebaux, S 2012, 'Minimal Landmarks for Optimal Delete-Free Planning', International Conference on Automated Planning and Scheduling (ICAPS 2012), AAAI Press, pp. 353-357.
- Bauer, A, Botea, V, Brown, M et al 2010, 'An Integrated Modelling, Debugging, and Visualization Environment for G12', International Conference on Principles and Practice of Constraint Programming (CP 2010), ed. D. Cohen, Springer, Scotland, p. 15.
- Slaney, J 2010, 'A Logic for Vagueness', Australasian Journal of Logic, vol. 8, pp. 100-134.
- Baumgartner, P & Slaney, J 2009, 'Constraint Modelling: A Challenge for First Order Automated Reasoning', International Workshop on First-Order Theorem Proving (FTP 2009), ed. Nicolas Peltier, Viorica Sofronie-Stokkermans, CEUR-WS.ORG, Oslo, Norway, pp. 4-18.
- Anbulagan, A & Slaney, J 2009, 'Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness', IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2009), ed. Sotirios G. Ziavras, IEEE Computer Society, Newark, USA, pp. 99-106.
- Slaney, J & Ali, A 2008, 'Generating loops with the inverse property', Empirically Successful Automated Reasoning in Mathematics (ESARM 2008), ed. G. Sutcliffe, S. Colton, S. Schulz, CEUR-WS.ORG, online, pp. 55-66.
- Ali, A & Slaney, J 2008, 'Counting loops with the inverse property', Quasigroups and Related Systems, vol. 16, no. 1, pp. 13-16.
- Kowalski, T & Slaney, J 2008, 'A finite fragment of S3', Reports on Mathematical Logic, vol. 43, pp. 65-72.
- Anbulagan, A, Pham, D, Slaney, J et al 2007, 'Boosting SLS using resolution', in F. Benhamou, N. Jussien, B. O'Sullivan (ed.), Trends in Constraint Programming, ISTE Publishing Knowledge, London UK, pp. 283-290.
- Kilby, P, Slaney, J, Thiebaux, S et al 2006, 'Estimating search tree size', National Conference on Artificial Intelligence (AAAI 2006), ed. Y. Gil, R.J. Mooney, AAAI Press, Boston, USA, pp. 1014-1019.
- Anbulagan, A & Slaney, J 2006, 'Multiple preprocessing for systematic SAT solvers', International Workshop on the Implementation of Logics (IWIL 2006), ed. C. Benzmueller, B. Fischer, G. Sutcliffe, Conference Organising Committee, Germany, pp. 100-116.
- Thiebaux, S, Gretton, C, Slaney, J et al 2006, 'Decision-theoretic planning with non-Markovian rewards', Journal of Artificial Intelligence Research, vol. 25, pp. 17-74.
- Anbulagan, A, Pham, D, Slaney, J et al 2006, 'Boosting SLS performance by incorporating resolution-based preprocessor', International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2006), ed. Conference Program Committee, Conference Organising Committee, France, pp. 43-57.
- Anbulagan, A & Slaney, J 2005, 'Lookahead saturation with restriction for SAT', International Conference on Principles and Practice of Constraint Programming (CP 2005), ed. Peter van Beek, Springer, Berlin, pp. 727-731.
- Kilby, P, Slaney, J & Walsh, T 2005, 'The backbone of the travelling salesperson', International Joint Conference on Artificial Intelligence (IJCAI 2005), ed. Leslie P. Kaelbling, Alessandro Saffiotti, AAAI Press, Edinburgh, Scotland, pp. 175-180.
- Slaney, J 2005, 'Semipositive LTL with an uninterpreted past operator', Logic Journal of the IGPL, vol. 13, no. 2, pp. 211-229.
- Stuckey, P, Garcia de la Banda, M, Maher, M et al 2005, 'The G12 project: mapping solver independent models to efficient solutions', International Conference on Principles and Practice of Constraint Programming (CP 2005), ed. Peter van Beek, Springer, Berlin, pp. 13-16.
- Kilby, P, Slaney, J, Thiebaux, S et al 2005, 'Backbones and backdoors in satisfiability', National Conference on Artificial Intelligence, and Innovative Applications of Artificial Intelligence Conference 2005, ed. Manuela Veloso, Subbarao Kambhampati, Neil Jacobstein, Bruce Porter, AAAI Press, Munich, Germany, pp. 1368-1373.
- Anbulagan, A, Pham, D, Slaney, J et al 2005, 'Old resolution meets modern SLS', National Conference on Artificial Intelligence, and Innovative Applications of Artificial Intelligence Conference 2005, ed. Manuela Veloso, Subbarao Kambhampati, Neil Jacobstein, Bruce Porter, AAAI Press, Munich, Germany, pp. 354-359.
- Slaney, J, Binas, A & Price, D 2004, 'Guiding a theorem prover with soft constraints', European Conference on Artificial Intelligence (ECAI 2004), ed. Ramon Lopez de Mantaras, Lorenza Saitta, IOS Press, The Netherlands, pp. 221-225.
- Binas, A & Slaney, J 2004, 'Semantically guiding a first-order theorem prover with a soft model', National Conference on Artificial Intelligence (AAAI 2004), AAAI Press, USA, pp. 948-949.
- Slaney, J 2004, 'Relevant logic and paraconsistency', in L.Bertossi, A. Hunter, T. Schaub (ed.), Inconsistency Tolerance, Springer, Heidelberg, Germany, pp. 270-293.
- Bertoli, P, Cimatti, A, Slaney, J et al 2002, 'Solving power supply restoration problems with planning via symbolic model-checking', AI Planning and Scheduling 2002 Workshop on Planning via Model-Checking, ed. F. Kabanza, S. Thiebaux, LAAS-CNRS, Toulouse, France, pp. 23-29.
- Thiebaux, S, Kabanza, F & Slaney, J 2002, 'Anytime state-based solution methods for decision processes with non-Markovian rewards', Conference on Uncertainty in Artificial Intelligence (UAI 2002), ed. A. Darwiche, N. Friedman, Morgan Kauffman Publishers, San Francisco, USA, pp. 501-510.
- Thiebaux, S, Kabanza, F & Slaney, J 2002, 'A model-checking approach to decision-theoretic planning with non-Markovian rewards', European Conference on Artificial Intelligence: Workshop on Model Checking and Artificial Intelligence, ed. M. Benerecetti, Conference Organising Committee, Lyon, France, pp. 101-108.
- Hodgson, K & Slaney, J 2002, 'TPTP, CASC and the development of a semantically guided theorem prover', AI Communications, vol. 15, pp. 135-146.
- Slaney, J 2002, 'More proofs of an axiom of Lukasiewicz', Journal of Automated Reasoning, vol. 29, no. 1, pp. 59-66.
- Bertoli, P, Cimatti, A, Slaney, J et al 2002, 'Solving power supply restoration problems with planning via symbolic model checking', European Conference on Artificial Intelligence (ECAI 2002), ed. F. van Harmelen, IOS Press, The Netherlands, pp. 576-580.
- Meyer, R & Slaney, J 2002, 'A, still adorable', World Congress on Paraconsistency 2002, ed. W.A. Carnielli, M.E. Coniglio, I.M.L. D�Ottaviano, Marcel Dekker Inc., New York, USA, pp. 241-260.
- Slaney, J & Walsh, T 2002, 'Phase transition behavior: From decision to optimisation', International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002), Conference Organising Committee, Cincinnati, USA (online), pp. 273-280.
- Slaney, J & Thiebaux, S 2001, 'Blocks World Revisited', Artificial Intelligence, vol. 125, pp. 119-153.
- Slaney, J & Walsh, T 2001, 'Backbones in Optimization and Approximation', International Joint Conference on Artificial Intelligence (IJCAI 2001), ed. Nebel, B., Morgan Kauffman Publishers, San Fransico, USA, pp. 254-259.
- Hodgson, K & Slaney, J 2001, 'System Description: SCOTT-5', International Joint Conference on Automated Reasoning (IJCAR 2001), ed. Gore, R; Leitsch, A; Nipkow, T, Springer, Berlin, Germany, pp. 443-447.
- Slaney, J & Thiebaux, S 2001, 'Blocks World Revisited', Artificial Intelligence, vol. 125, pp. 119-153.
- Slaney, J 2000, 'Is There a Constrainedness Knife-edge?', European Conference on Artificial Intelligence (ECAI 2000), IOS Press, Amsterdam, pp. 614-618.
- Thiebaux, S, Slaney, J & Kilby, P 2000, 'Estimating the Hardness of Optimisation', European Conference on Artificial Intelligence (ECAI 2000), IOS Press, Amsterdam, pp. 123-127.
- Thiebaux, S, Slaney, J & Kilby, P 2000, 'Estimating the Hardness of Optimisation', European Conference on Artificial Intelligence (ECAI 2000), IOS Press, Amsterdam, pp. 123-127.
