 | 2008 |
|---|
| 49 |       | John K. Slaney:
Constraint Modelling: A Challenge for First Order Automated Reasoning (Invited Talk).
PAAR/ESHOL 2008 |
| 2006 |
|---|
| 48 |  | Philip Kilby,
John K. Slaney,
Sylvie Thiébaux,
Toby Walsh:
Estimating Search Tree Size.
AAAI 2006 |
| 47 | | Sylvie Thiébaux,
Charles Gretton,
John K. Slaney,
David Price,
Froduald Kabanza:
Decision-Theoretic Planning with non-Markovian Rewards.
J. Artif. Intell. Res. (JAIR) 25: 17-74 (2006) |
| 2005 |
|---|
| 46 | | Philip Kilby,
John K. Slaney,
Sylvie Thiébaux,
Toby Walsh:
Backbones and Backdoors in Satisfiability.
AAAI 2005: 1368-1373 |
| 45 | | Anbulagan,
Duc Nghia Pham,
John K. Slaney,
Abdul Sattar:
Old Resolution Meets Modern SLS.
AAAI 2005: 354-359 |
| 44 | | Peter J. Stuckey,
Maria J. García de la Banda,
Michael J. Maher,
Kim Marriott,
John K. Slaney,
Zoltan Somogyi,
Mark Wallace,
Toby Walsh:
The G12 Project: Mapping Solver Independent Models to Efficient Solutions.
CP 2005: 13-16 |
| 43 | | Anbulagan,
John K. Slaney:
Lookahead Saturation with Restriction for SAT.
CP 2005: 727-731 |
| 42 | | Peter J. Stuckey,
Maria J. García de la Banda,
Michael J. Maher,
Kim Marriott,
John K. Slaney,
Zoltan Somogyi,
Mark Wallace,
Toby Walsh:
The G12 Project: Mapping Solver Independent Models to Efficient Solutions.
ICLP 2005: 9-13 |
| 41 | | Philip Kilby,
John K. Slaney,
Toby Walsh:
The Backbone of the Travelling Salesperson.
IJCAI 2005: 175-180 |
| 40 | | John K. Slaney:
Relevant Logic and Paraconsistency.
Inconsistency Tolerance 2005: 270-293 |
| 39 | | John K. Slaney:
Semipositive LTL with an Uninterpreted Past Operator.
Logic Journal of the IGPL 13(2): 211-229 (2005) |
| 2004 |
|---|
| 38 | | Arnold Binas,
John K. Slaney:
Semantically Guiding a First-Order Theorem Prover with a Soft Model.
AAAI 2004: 948-949 |
| 37 | | John K. Slaney,
Arnold Binas,
David Price:
Guiding a Theorem Prover with Soft Constraints.
ECAI 2004: 221-225 |
| 2002 |
|---|
| 36 | | Bob McKay,
John K. Slaney:
AI 2002: Advances in Artificial Intelligence, 15th Australian Joint Conference on Artificial Intelligence, Canberra, Australia, December 2-6, 2002, Proceedings
Springer 2002 |
| 35 | | Piergiorgio Bertoli,
Alessandro Cimatti,
John K. Slaney,
Sylvie Thiébaux:
Solving Power Supply Restoration Problems with Planning via Symbolic Model Checking.
ECAI 2002: 576-580 |
| 34 | | Sylvie Thiébaux,
Froduald Kabanza,
John K. Slaney:
Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards.
UAI 2002: 501-510 |
| 33 | | Kahlil Hodgson,
John K. Slaney:
TPTP, CASC and the development of a semantically guided theorem prover.
AI Commun. 15(2-3): 135-146 (2002) |
| 32 | | John K. Slaney:
More Proofs of an Axiom of Lukasiewicz.
J. Autom. Reasoning 29(1): 59-66 (2002) |
| 2001 |
|---|
| 31 | | John K. Slaney,
Toby Walsh:
Backbones in Optimization and Approximation.
IJCAI 2001: 254-259 |
| 30 | | Kahlil Hodgson,
John K. Slaney:
System Description: SCOTT-5.
IJCAR 2001: 443-447 |
| 29 | | John K. Slaney,
Sylvie Thiébaux:
Blocks World revisited.
Artif. Intell. 125(1-2): 119-153 (2001) |
| 2000 |
|---|
| 28 | | Riichiro Mizoguchi,
John K. Slaney:
PRICAI 2000, Topics in Artificial Intelligence, 6th Pacific Rim International Conference on Artificial Intelligence, Melbourne, Australia, August 28 - September 1, 2000, Proceedings
Springer 2000 |
| 27 | | John K. Slaney,
Sylvie Thiébaux,
Philip Kilby:
Estimating the Hardness of Optimisation.
ECAI 2000: 123-130 |
| 26 | | John K. Slaney:
Is there a Constaintness Knife-edge?
ECAI 2000: 614-620 |
| 25 | | John K. Slaney:
Introduction.
Inf. Comput. 162(1-2): 1-2 (2000) |
| 1999 |
|---|
| 24 | | Hongxue Wang,
Vijay Varadharajan,
John K. Slaney:
Towards Perfect Objects.
TOOLS (32) 1999: 115-126 |
| 1998 |
|---|
| 23 | | Grigoris Antoniou,
John K. Slaney:
Advanced Topics in Artificial Intelligence, 11th Australian Joint Conference on Artificial Intelligence, AI '98, Brisbane, Australia, July 13-17, 1998, Selected Papers
Springer 1998 |
| 22 | | Hongxue Wang,
John K. Slaney:
GISM: A Language for Modelling and Developing Agent-Based Intelligent Systems.
DAI 1998: 122-136 |
| 21 | | John K. Slaney,
Sylvie Thiébaux:
On the Hardness of Decision and Optimisation Problems.
ECAI 1998: 244-248 |
| 1997 |
|---|
| 20 | | John K. Slaney:
Minlog: A Minimal Logic Theorem Prover.
CADE 1997: 268-271 |
| 19 | | John K. Slaney,
Robert Meyer:
Logic for Two: The Semantics of Distributive Substructural Logics.
ECSQARU-FAPR 1997: 554-567 |
| 1996 |
|---|
| 18 | | Michael A. McRobbie,
John K. Slaney:
Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings
Springer 1996 |
| 17 | | John K. Slaney,
Sylvie Thiébaux:
Linear Time Near-Optimal Planning in the Blocks World.
AAAI/IAAI, Vol. 2 1996: 1208-1214 |
| 16 | | John K. Slaney,
Timothy Surendonk:
Combining Finite Model Generation with Theorem Proving: Problems and Prospects.
Frontiers of Combining Systems (FroCos) 1996: 141-155 |
| 1995 |
|---|
| 15 | | Greg Restall,
John K. Slaney:
Realistic Belief Revision.
WOCFAI 1995: 367-378 |
| 1994 |
|---|
| 14 | | John K. Slaney:
The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure.
CADE 1994: 1-13 |
| 13 | | John K. Slaney,
Ewing L. Lusk,
William McCune:
SCOTT: Semantically Constrained Otter System Description.
CADE 1994: 764-768 |
| 12 | | John K. Slaney:
FINDER: Finite Domain Enumerator - System Description.
CADE 1994: 798-801 |
| 1993 |
|---|
| 11 | | John K. Slaney:
SCOTT: A Model-Guided Theorem Prover.
IJCAI 1993: 109-115 |
| 10 | | Masayuki Fujita,
John K. Slaney,
Frank Bennett:
Automatic Generation of Some Results in Finite Algebra.
IJCAI 1993: 52-59 |
| 9 | | John K. Slaney:
Sentential constants in systems near R.
Studia Logica 52(3): 443-456 (1993) |
| 1992 |
|---|
| 8 | | Ewing L. Lusk,
William McCune,
John K. Slaney:
ROO: A Parallel Theorem Prover.
CADE 1992: 731-734 |
| 1991 |
|---|
| 7 | | John K. Slaney:
The Implications of Paraconsistency.
IJCAI 1991: 1052-1059 |
| 6 | | John K. Slaney:
The Ackermann Constant Theorem: A Computer-Assisted Investigation.
J. Autom. Reasoning 7(4): 453-474 (1991) |
| 1990 |
|---|
| 5 | | John K. Slaney,
Ewing L. Lusk:
Parallelizing the Closure Computation in Automated Deduction.
CADE 1990: 28-39 |
| 4 | | Paul Pritchard,
John K. Slaney:
Tutorial on Computing Models of Propositional Logics.
CADE 1990: 685 |
| 3 | | Ewing L. Lusk,
William McCune,
John K. Slaney:
Parallel Closure-Based Automated Reasoning.
Dagstuhl Seminar on Parallelization in Inference Systems 1990: 347 |
| 1989 |
|---|
| 2 | | John K. Slaney:
On the Structure of De Morgan Monoids with Corollaries on Relevant Logic and Theories.
Notre Dame Journal of Formal Logic 30(1): 117-129 (1989) |
| 1985 |
|---|
| 1 | | John K. Slaney:
3088 Varieties A Solution to the Ackermann Constant Problem.
J. Symb. Log. 50(2): 487-501 (1985) |
