# John K. Slaney

According to our database

Collaborative distances:

^{1}, John K. Slaney authored at least 52 papers between 1985 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2013

Planning with MIP for Supply Restoration in Power Distribution Systems.

Proceedings of the IJCAI 2013, 2013

2012

On the Ternary Relation and Conditionality.

J. Philosophical Logic, 2012

Visualising Reasoning: What ATP Can Learn From CP.

Electr. Notes Theor. Comput. Sci., 2012

Minimal Landmarks for Optimal Delete-Free Planning.

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

2010

An Integrated Modelling, Debugging, and Visualisation Environment for G12.

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness.

Proceedings of the ICTAI 2009, 2009

2008

A finite fragment of S3.

Reports on Mathematical Logic, 2008

Constraint Modelling: A Challenge for First Order Automated Reasoning (Invited Talk).

Proceedings of the First International Workshop on Practical Aspects of Automated Reasoning, 2008

2006

Decision-Theoretic Planning with non-Markovian Rewards.

J. Artif. Intell. Res., 2006

Estimating Search Tree Size.

Proceedings of the Proceedings, 2006

2005

Semipositive LTL with an Uninterpreted Past Operator.

Logic Journal of the IGPL, 2005

The Backbone of the Travelling Salesperson.

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

The G12 Project: Mapping Solver Independent Models to Efficient Solutions.

Proceedings of the Logic Programming, 21st International Conference, 2005

Relevant Logic and Paraconsistency.

Proceedings of the Inconsistency Tolerance [result from a Dagstuhl seminar], 2005

Lookahead Saturation with Restriction for SAT.

Proceedings of the Principles and Practice of Constraint Programming, 2005

Backbones and Backdoors in Satisfiability.

Proceedings of the Proceedings, 2005

Old Resolution Meets Modern SLS.

Proceedings of the Proceedings, 2005

2004

Guiding a Theorem Prover with Soft Constraints.

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Semantically Guiding a First-Order Theorem Prover with a Soft Model.

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2002

More Proofs of an Axiom of Lukasiewicz.

J. Autom. Reasoning, 2002

TPTP, CASC and the development of a semantically guided theorem prover.

AI Commun., 2002

Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards.

Proceedings of the UAI '02, 2002

Solving Power Supply Restoration Problems with Planning via Symbolic Model Checking.

Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002

2001

Blocks World revisited.

Artif. Intell., 2001

Backbones in Optimization and Approximation.

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

System Description: SCOTT-5.

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Introduction.

Inf. Comput., 2000

Estimating the Hardness of Optimisation.

Proceedings of the ECAI 2000, 2000

Is there a Constaintness Knife-edge?

Proceedings of the ECAI 2000, 2000

1999

Towards Perfect Objects.

Proceedings of the TOOLS Pacific 1999: 32nd International Conference on Technology of Object-Oriented Languages and Systems, 1999

1998

On the Hardness of Decision and Optimisation Problems.

Proceedings of the 13th European Conference on Artificial Intelligence, 1998

GISM: A Language for Modelling and Developing Agent-Based Intelligent Systems.

Proceedings of the Multi-Agent Systems: Theories, 1998

1997

Logic for Two: The Semantics of Distributive Substructural Logics.

Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

Minlog: A Minimal Logic Theorem Prover.

Proceedings of the Automated Deduction, 1997

1996

Combining Finite Model Generation with Theorem Proving: Problems and Prospects.

Proceedings of the Frontiers of Combining Systems, 1996

Linear Time Near-Optimal Planning in the Blocks World.

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Realistic Belief Revision.

Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, 1995

1994

SCOTT: Semantically Constrained Otter System Description.

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

FINDER: Finite Domain Enumerator - System Description.

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure.

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993

Sentential constants in systems near R.

Studia Logica, 1993

SCOTT: A Model-Guided Theorem Prover.

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

Automatic Generation of Some Results in Finite Algebra.

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

ROO: A Parallel Theorem Prover.

Proceedings of the Automated Deduction, 1992

1991

The Ackermann Constant Theorem: A Computer-Assisted Investigation.

J. Autom. Reasoning, 1991

The Implications of Paraconsistency.

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1990

Parallel Closure-Based Automated Reasoning.

Proceedings of the Parallelization in Inference Systems, 1990

Parallelizing the Closure Computation in Automated Deduction.

Proceedings of the 10th International Conference on Automated Deduction, 1990

Tutorial on Computing Models of Propositional Logics.

Proceedings of the 10th International Conference on Automated Deduction, 1990

1989

On the Structure of De Morgan Monoids with Corollaries on Relevant Logic and Theories.

Notre Dame Journal of Formal Logic, 1989

1987

Reduced models for relevant logics without WI.

Notre Dame Journal of Formal Logic, 1987

1985

3088 Varieties A Solution to the Ackermann Constant Problem.

J. Symb. Log., 1985