default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn K. Slaney
Person information
- affiliation: Australian National University, Acton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j18]John K. Slaney
, Bruno Woltzenlogel Paleo:
Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning. J. Autom. Reason. 60(2): 133-156 (2018)- [j17]John K. Slaney, Bruno Woltzenlogel Paleo:
Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning. J. Autom. Reason. 60(4): 527 (2018) - 2017
- [j16]John K. Slaney:
Logic for Fun: An Online Tool for Logical Modelling. FLAP 4(1) (2017) - [c43]Daniyar Itegulov, John K. Slaney, Bruno Woltzenlogel Paleo:
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution. CADE 2017: 344-356 - [i5]Daniyar Itegulov, John K. Slaney, Bruno Woltzenlogel Paleo:
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution. CoRR abs/1704.03275 (2017) - 2016
- [i4]John K. Slaney, Bruno Woltzenlogel Paleo:
Conflict Resolution: a First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning. CoRR abs/1602.04568 (2016) - 2015
- [i3]John K. Slaney:
Logic considered fun. CoRR abs/1507.03683 (2015) - 2014
- [j15]John K. Slaney, Edward Walker:
The One-Variable Fragment of T→. J. Philos. Log. 43(5): 867-878 (2014) - [c42]John K. Slaney:
Set-theoretic duality: A fundamental feature of combinatorial optimisation. ECAI 2014: 843-848 - 2013
- [c41]Sylvie Thiébaux, Carleton Coffrin, Hassan L. Hijazi, John K. Slaney:
Planning with MIP for Supply Restoration in Power Distribution Systems. IJCAI 2013: 2900-2907 - [i2]Sylvie Thiébaux, Froduald Kabanza, John K. Slaney:
Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards. CoRR abs/1301.0606 (2013) - 2012
- [j14]J. C. Beall, Ross T. Brady, J. Michael Dunn, Allen Hazen, Edwin D. Mares, Robert K. Meyer, Graham Priest, Greg Restall, David Ripley, John K. Slaney, Richard Sylvan:
On the Ternary Relation and Conditionality. J. Philos. Log. 41(3): 595-612 (2012) - [c40]Patrik Haslum, John K. Slaney, Sylvie Thiébaux:
Minimal Landmarks for Optimal Delete-Free Planning. ICAPS 2012 - 2011
- [i1]Charles Gretton, Froduald Kabanza, David Price, John K. Slaney, Sylvie Thiébaux:
Decision-Theoretic Planning with non-Markovian Rewards. CoRR abs/1109.2355 (2011) - 2010
- [c39]Andreas Bauer, Viorica Botea, Mark Brown, Matt Gray, Daniel Harabor, John K. Slaney:
An Integrated Modelling, Debugging, and Visualisation Environment for G12. CP 2010: 522-536 - [c38]John K. Slaney:
Visualising Reasoning: What ATP Can Learn From CP. UITP 2010: 57-70
2000 – 2009
- 2009
- [c37]Peter Baumgartner, John K. Slaney:
Constraint Modelling: A Challenge for First Order Automated Reasoning. FTP 2009 - [c36]Anbulagan, John K. Slaney:
Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness. ICTAI 2009: 99-106 - 2008
- [j13]Tomasz Kowalski, John K. Slaney:
A finite fragment of S3. Reports Math. Log. 43: 65-72 (2008) - [c35]John K. Slaney:
Constraint Modelling: A Challenge for First Order Automated Reasoning (Invited Talk). PAAR/ESHOL 2008 - 2006
- [j12]Sylvie Thiébaux, Charles Gretton, John K. Slaney, David Price, Froduald Kabanza:
Decision-Theoretic Planning with non-Markovian Rewards. J. Artif. Intell. Res. 25: 17-74 (2006) - [c34]Philip Kilby, John K. Slaney, Sylvie Thiébaux, Toby Walsh:
Estimating Search Tree Size. AAAI 2006: 1014-1019 - 2005
- [j11]John K. Slaney:
Semipositive LTL with an Uninterpreted Past Operator. Log. J. IGPL 13(2): 211-229 (2005) - [c33]Anbulagan, Duc Nghia Pham, John K. Slaney, Abdul Sattar:
Old Resolution Meets Modern SLS. AAAI 2005: 354-359 - [c32]Philip Kilby, John K. Slaney, Sylvie Thiébaux, Toby Walsh:
Backbones and Backdoors in Satisfiability. AAAI 2005: 1368-1373 - [c31]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 - [c30]Anbulagan, John K. Slaney:
Lookahead Saturation with Restriction for SAT. CP 2005: 727-731 - [c29]John K. Slaney:
Relevant Logic and Paraconsistency. Inconsistency Tolerance 2005: 270-293 - [c28]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 - [c27]Philip Kilby, John K. Slaney, Toby Walsh:
The Backbone of the Travelling Salesperson. IJCAI 2005: 175-180 - 2004
- [c26]Arnold Binas, John K. Slaney:
Semantically Guiding a First-Order Theorem Prover with a Soft Model. AAAI 2004: 948-949 - [c25]John K. Slaney, Arnold Binas, David Price:
Guiding a Theorem Prover with Soft Constraints. ECAI 2004: 221-225 - 2002
- [j10]Kahlil Hodgson, John K. Slaney:
TPTP, CASC and the development of a semantically guided theorem prover. AI Commun. 15(2-3): 135-146 (2002) - [j9]John K. Slaney:
More Proofs of an Axiom of Lukasiewicz. J. Autom. Reason. 29(1): 59-66 (2002) - [c24]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 - [c23]Sylvie Thiébaux, Froduald Kabanza, John K. Slaney:
Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards. UAI 2002: 501-510 - [e4]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. Lecture Notes in Computer Science 2557, Springer 2002, ISBN 3-540-00197-2 [contents] - 2001
- [j8]John K. Slaney, Sylvie Thiébaux:
Blocks World revisited. Artif. Intell. 125(1-2): 119-153 (2001) - [c22]Kahlil Hodgson, John K. Slaney:
System Description: SCOTT-5. IJCAR 2001: 443-447 - [c21]John K. Slaney, Toby Walsh:
Backbones in Optimization and Approximation. IJCAI 2001: 254-259 - 2000
- [j7]John K. Slaney:
Introduction. Inf. Comput. 162(1-2): 1-2 (2000) - [c20]John K. Slaney, Sylvie Thiébaux, Philip Kilby:
Estimating the Hardness of Optimisation. ECAI 2000: 123-130 - [c19]John K. Slaney:
Is there a Constaintness Knife-edge? ECAI 2000: 614-620 - [e3]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. Lecture Notes in Computer Science 1886, Springer 2000, ISBN 3-540-67925-1 [contents]
1990 – 1999
- 1999
- [c18]Hongxue Wang, Vijay Varadharajan, John K. Slaney:
Towards Perfect Objects. TOOLS (32) 1999: 115-126 - 1998
- [c17]Hongxue Wang, John K. Slaney:
GISM: A Language for Modelling and Developing Agent-Based Intelligent Systems. DAI 1998: 122-136 - [c16]John K. Slaney, Sylvie Thiébaux:
On the Hardness of Decision and Optimisation Problems. ECAI 1998: 244-248 - [e2]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. Lecture Notes in Computer Science 1502, Springer 1998, ISBN 3-540-65138-1 [contents] - 1997
- [c15]John K. Slaney:
Minlog: A Minimal Logic Theorem Prover. CADE 1997: 268-271 - [c14]John K. Slaney, Robert K. Meyer:
Logic for Two: The Semantics of Distributive Substructural Logics. ECSQARU-FAPR 1997: 554-567 - 1996
- [c13]John K. Slaney, Sylvie Thiébaux:
Linear Time Near-Optimal Planning in the Blocks World. AAAI/IAAI, Vol. 2 1996: 1208-1214 - [c12]John K. Slaney, Timothy J. Surendonk:
Combining Finite Model Generation with Theorem Proving: Problems and Prospects. FroCoS 1996: 141-155 - [e1]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. Lecture Notes in Computer Science 1104, Springer 1996, ISBN 3-540-61511-3 [contents] - 1995
- [c11]Greg Restall, John K. Slaney:
Realistic Belief Revision. WOCFAI 1995: 367-378 - 1994
- [c10]John K. Slaney:
The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure. CADE 1994: 1-13 - [c9]John K. Slaney, Ewing L. Lusk, William McCune:
SCOTT: Semantically Constrained Otter System Description. CADE 1994: 764-768 - [c8]John K. Slaney:
FINDER: Finite Domain Enumerator - System Description. CADE 1994: 798-801 - 1993
- [j6]John K. Slaney:
Sentential constants in systems near R. Stud Logica 52(3): 443-456 (1993) - [c7]Masayuki Fujita, John K. Slaney, Frank Bennett:
Automatic Generation of Some Results in Finite Algebra. IJCAI 1993: 52-59 - [c6]John K. Slaney:
SCOTT: A Model-Guided Theorem Prover. IJCAI 1993: 109-115 - 1992
- [c5]Ewing L. Lusk, William McCune, John K. Slaney:
ROO: A Parallel Theorem Prover. CADE 1992: 731-734 - 1991
- [j5]John K. Slaney:
The Ackermann Constant Theorem: A Computer-Assisted Investigation. J. Autom. Reason. 7(4): 453-474 (1991) - [c4]John K. Slaney:
The Implications of Paraconsistency. IJCAI 1991: 1052-1059 - 1990
- [c3]John K. Slaney, Ewing L. Lusk:
Parallelizing the Closure Computation in Automated Deduction. CADE 1990: 28-39 - [c2]Paul Pritchard, John K. Slaney:
Tutorial on Computing Models of Propositional Logics. CADE 1990: 685 - [c1]Ewing L. Lusk, William McCune, John K. Slaney:
Parallel Closure-Based Automated Reasoning. Dagstuhl Seminar on Parallelization in Inference Systems 1990: 347
1980 – 1989
- 1989
- [j4]John K. Slaney:
Solution to a problem of Ono and Komori. J. Philos. Log. 18(1): 103-111 (1989) - [j3]John K. Slaney:
On the Structure of De Morgan Monoids with Corollaries on Relevant Logic and Theories. Notre Dame J. Formal Log. 30(1): 117-129 (1989) - 1987
- [j2]John K. Slaney:
Reduced models for relevant logics without WI. Notre Dame J. Formal Log. 28(3): 395-407 (1987) - 1985
- [j1]John K. Slaney:
3088 Varieties A Solution to the Ackermann Constant Problem. J. Symb. Log. 50(2): 487-501 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-24 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
