John Slaney
-
- Formal Methods in Verification 10
- Advanced Algebra and Logic 8
- semigroups and automata theory 4
- Artificial Intelligence top 2%
- Logic, Reasoning, and Knowledge 20
- Logic, programming, and type systems 20
- AI-based Problem Solving and Planning 6
- Semantic Web and Ontologies 6
- Software top 5%
-
- Constraint Satisfaction and Optimization 9
John Slaney
54 papers receiving 843 citations
Peers
Comparison fields: 5 of 80
- Computational Theory and Mathematics 388
- Artificial Intelligence 710
- Software 58
- Computer Networks and Communications 227
- Industrial and Manufacturing Engineering 58
Countries citing papers authored by John Slaney
This map shows the geographic impact of John Slaney's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by John Slaney with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Slaney more than expected).
Fields of papers citing papers by John Slaney
This network shows the impact of papers produced by John Slaney. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by John Slaney. The network helps show where John Slaney may publish in the future.
Co-authorship network
The 25 scholars most cited alongside John Slaney, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | Logic for Fun: An Online Tool for Logical Modelling. | 2017 | 1 |
| 3 | Planning with MIP for supply restoration in power distribution systems | 2013 | 25 |
| 4 | Counting loops with the inverse property | 2008 | 9 |
| 5 | A FINITE FRAGMENT OF S3 | 2008 | 1 |
| 6 | Estimating search tree size | 2006 | 30 |
| 7 | Old resolution meets modern SLS | 2005 | 20 |
| 8 | 2005 | 53 | |
| 9 | The backbone of the travelling salesperson | 2005 | 20 |
| 10 | Guiding a theorem prover with soft constraints | 2004 | 2 |
| 11 | TPTP, CASC and the development of a semantically guided theorem prover | 2002 | 1 |
| 12 | AI 2002 : Advances in Artificial Intelligence : 15th Australian Joint Conference on Artificial Intelligence, Canberra, Australia, December 2-6, 2002 : proceedings | 2002 | 1 |
| 13 | Backbones in optimization and approximation | 2001 | 54 |
| 14 | Estimating the hardness of optimisation | 2000 | 5 |
| 15 | Linear arithmetic desecsed | 1996 | 4 |
| 16 | Linear time near-optimal planning in the blocks world | 1996 | 13 |
| 17 | Automatic generation of some results in finite algebra | 1993 | 41 |
| 18 | SCOTT: a model-guided theorem prover | 1993 | 15 |
| 19 | Finite models for some substructural logics | 1992 | 1 |
| 20 | The implications of paraconsistency | 1991 | 8 |
About John Slaney
John Slaney is a scholar working on Theoretical Computer Science, Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology and Computer Networks and Communications, having authored 56 papers that have together received 948 indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (20 papers), Logic, programming, and type systems (20 papers), Formal Methods in Verification (10 papers), Constraint Satisfaction and Optimization (9 papers), Advanced Algebra and Logic (8 papers), AI-based Problem Solving and Planning (6 papers), Semantic Web and Ontologies (6 papers) and semigroups and automata theory (4 papers). The work is most often cited by research in Computational Theory and Mathematics (388 citations), Artificial Intelligence (710 citations), Software (58 citations), Computer Networks and Communications (227 citations) and Industrial and Manufacturing Engineering (58 citations). John Slaney has collaborated with scholars based in Australia, United Kingdom and Japan. Frequent co-authors include Sylvie Thiébaux, Toby Walsh, Philip Kilby, Masayuki Fujita, Dov M. Gabbay, Greg Restall, Riichiro Mizoguchi, F.E. Bennett, Robert K. Meyer and M.E. Stickel. Their work appears in journals such as Analysis, Notre Dame Journal of Formal Logic, Journal of Philosophical Logic, Journal of Automated Reasoning and Studia Logica.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.