Research graph
References from Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT. Local targets link to admitted publications; unresolved targets remain external evidence.
Unresolved reference
2005 · External reference
Unresolved reference
1996 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2014 · External reference
Structure instances for SAT instances classification
10.1016/j.jal.2016.11.004 · 2017 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2009 · External reference
On the Glucose SAT Solver
10.1142/s0218213018400018 · 2018 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
1995 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2008 · External reference
PicoSAT Essentials
10.3233/sat190039 · 2008 · External reference
10.21236/ada360973
10.21236/ada360973 · 1999 · External reference
Unresolved reference
2020 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2021 · External reference
Unresolved reference
2006 · External reference
A Verified SAT Solver Framework with Learn, Forget, Restart and Incrementality
10.1007/s10817-018-9455-7 · 2018 · External reference
Fast unfolding of communities in large networks
10.1088/1742-5468/2008/10/p10008 · 2008 · External reference
10.1017/cbo9780511804076
10.1017/cbo9780511804076 · 2007 · External reference
Unresolved reference
1998 · External reference
Unresolved reference
1998 · External reference
Learning Evaluation Functions to Improve Optimization by Local Search
2000 · External reference
Random Forests
10.1023/a:1010933404324 · 2001 · External reference
Machine Learning for First-Order Theorem Proving: Learning to Select a Good Heuristic
10.1007/s10817-014-9301-5 · 2014 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2020 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2004 · External reference
10.1109/iske.2017.8258780
10.1109/iske.2017.8258780 · 2017 · External reference
A New Rewarding Mechanism for Branching Heuristic in SAT Solvers
10.2991/ijcis.2019.125905649 · 2018 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2019 · External reference
Cache Conscious Data Structures for Boolean Satisfiability Solvers
10.3233/sat190064 · 2010 · External reference
Unresolved reference
2019 · External reference
Bounded Model Checking Using Satisfiability Solving
10.1023/a:1011276507260 · 2001 · External reference
Power-Law Distributions in Empirical Data
10.1137/070710111 · 2009 · External reference
Unresolved reference
2001 · External reference
Unresolved reference
2005 · External reference
A machine program for theorem-proving
10.1145/368273.368557 · 1962 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2008 · External reference
10.1007/978-1-4612-0711-5
10.1007/978-1-4612-0711-5 · 1996 · External reference
Unresolved reference
2000 · External reference
Contraction-Free Sequent Calculi for Intuitionistic Logic
10.2307/2275431 · 1992 · External reference
Unresolved reference
2005 · External reference
Unresolved reference
2003 · External reference
Unresolved reference
2000 · External reference
Unresolved reference
2018 · External reference
10.1017/cbo9781139164542
10.1017/cbo9781139164542 · 2001 · External reference
10.1007/978-3-642-74688-8_10
10.1007/978-3-642-74688-8_10 · 1989 · External reference
Can Neural Networks Understand Logical Entailment?
2018 · External reference
Machine Learning Guidance for Connection Tableaux
10.1007/s10817-020-09576-7 · 2021 · External reference
Do we Need Hundreds of Classifiers to Solve Real World Classification Problems?
2014 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2016 · External reference
Feature-based learning of searchguiding heuristics for theorem proving
1998 · External reference
Unresolved reference
2002 · External reference
Unresolved reference
2004 · External reference
Automated Discovery of Local Search Heuristics for Satisfiability Testing
10.1162/evco.2008.16.1.31 · 2008 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
1979 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
External reference
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
10.1613/jair.1959 · 2006 · External reference
Unresolved reference
2002 · External reference
Algorithm portfolios
10.1016/s0004-3702(00)00081-3 · 2001 · External reference
Unresolved reference
2016 · External reference
Evolutionary Algorithms for the Satisfiability Problem
10.1162/106365602317301763 · 2002 · External reference
Unresolved reference
2010 · External reference
Can Machine Learning Learn a Decision Oracle for NP Problems? A Test on SAT
10.3233/fi-2014-1024 · 2014 · External reference
10.1007/978-3-540-35488-8
10.1007/978-3-540-35488-8 · 2006 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2009 · External reference
Learning for Dynamic Subsumption
10.1142/s0218213010000303 · 2010 · External reference
Graph Representation Learning
2020 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2020 · External reference
Unresolved reference
2020 · External reference
10.1017/cbo9780511576430
10.1017/cbo9780511576430 · 2009 · External reference
Unresolved reference
2018 · External reference
10.1007/978-0-387-84858-7
10.1007/978-0-387-84858-7 · 2009 · External reference
Unresolved reference
External reference
Unresolved reference
2016 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2017 · External reference
Long Short-Term Memory
10.1162/neco.1997.9.8.1735 · 1997 · External reference
Unresolved reference
2011 · External reference
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
10.1023/a:1022631118932 · 1993 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
1999 · External reference
Unresolved reference
2000 · External reference
Unresolved reference
External reference
‘Neural’ Computation of Decisions in Optimization Problems
10.1007/bf00339943 · 1985 · External reference
A Review of Recurrent Neural Networks: LSTM Cells and Network Architectures
10.1162/neco_a_01199 · 2019 · External reference
An Economics Approach to Hard Computational Problems
10.1126/science.275.5296.51 · 1997 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
2011 · External reference
ParamILS: An Automatic Algorithm Configuration Framework
10.1613/jair.2861 · 2009 · External reference
10.1007/978-3-030-05318-5
10.1007/978-3-030-05318-5 · 2019 · External reference
The Configurable SAT Solver Challenge (CSSC)
10.1016/j.artint.2016.09.006 · 2017 · External reference
Unresolved reference
2002 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2018 · External reference
Solving QBF with counterexample guided refinement
10.1016/j.artint.2016.01.004 · 2016 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2019 · External reference
Solving propositional satisfiability problems
10.1007/bf01531077 · 1990 · External reference
A Neural Network Approach to the 3-Satisfiability Problem
10.1016/0743-7315(89)90068-3 · 1989 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2010 · External reference
Nonparametric Estimation from Incomplete Observations
10.1080/01621459.1958.10501452 · 1958 · External reference
10.1002/9780470316801
10.1002/9780470316801 · 1990 · External reference
Unresolved reference
1992 · External reference
Unresolved reference
2006 · External reference
SATenstein: Automatically building local search SAT solvers from components
10.1016/j.artint.2015.11.002 · 2016 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
1995 · External reference
10.1007/978-3-319-50137-6_7
10.1007/978-3-319-50137-6_7 · 2016 · External reference
Unresolved reference
1992 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2018 · External reference
10.1007/978-94-015-7744-1
10.1007/978-94-015-7744-1 · 1987 · External reference
Unresolved reference
2000 · External reference
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability
10.1016/s1571-0653(04)00332-4 · 2001 · External reference
Unresolved reference
2019 · External reference
SETHEO: A high-performance theorem prover
10.1007/bf00244282 · 1992 · External reference
Clause vivification by unit propagation in CDCL SAT Solvers
2020 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2017 · External reference
Autofolio: an automatically configured algorithm selector
10.1613/jair.4726 · 2015 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2016 · External reference
Unresolved reference
1993 · External reference
Unresolved reference
2003 · External reference
Unresolved reference
2017 · External reference
Efficient data structures for backtrack search SAT solvers
2005 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2020 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
1999 · External reference
Unresolved reference
2008 · External reference
GRASP: a search algorithm for propositional satisfiability
10.1109/12.769433 · 1999 · External reference
Recursive functions of symbolic expressions and their computation by machine, Part I
10.1145/367177.367199 · 1960 · External reference
Unresolved reference
2003 · External reference
Unresolved reference
2008 · External reference
Automatically Configuring Constraint Satisfaction Programs: A Case Study
10.1007/bf00143877 · 1996 · External reference
Unresolved reference
1998 · External reference
Unresolved reference
1997 · External reference
Human-level control through deep reinforcement learning
10.1038/nature14236 · 2015 · External reference
Unresolved reference
2001 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2018 · External reference
Unresolved reference
2006 · External reference
Unresolved reference
2017 · External reference
Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T)
10.1145/1217856.1217859 · 2006 · External reference
Unresolved reference
2009 · External reference
Simple algorithm portfolio for SAT
10.1007/s10462-011-9290-2 · 2013 · External reference
Unresolved reference
2004 · External reference
Unresolved reference
2008 · External reference
Unresolved reference
2015 · External reference
Unresolved reference
1984 · External reference
Unresolved reference
2017 · External reference
Unresolved reference
2014 · External reference
Unresolved reference
2013 · External reference
Unresolved reference
2000 · External reference
Unresolved reference
2002 · External reference
Unresolved reference
2007 · External reference
10.1007/978-1-4419-1665-5_13
10.1007/978-1-4419-1665-5_13 · 2010 · External reference
Unresolved reference
2007 · External reference
A self-adaptive multi-engine solver for quantified Boolean formulas
10.1007/s10601-008-9051-2 · 2009 · External reference
Unresolved reference
1993 · External reference
Induction of Decision Trees
10.1023/a:1022643204877 · 1986 · External reference
Unresolved reference
2016 · External reference
The ILTP Problem Library for Intuitionistic Logic
10.1007/s10817-006-9060-z · 2007 · External reference
Constructing Conditional Plans by a Theorem-Prover
10.1613/jair.591 · 1999 · External reference
Learning Decision Lists
10.1023/a:1022607331053 · 1987 · External reference
Unresolved reference
2020 · External reference
10.1017/cbo9780511975509
10.1017/cbo9780511975509 · 2011 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2019 · External reference
A Simple Method for Regression Analysis with Censored Data
10.1080/00401706.1979.10489811 · 1979 · External reference
Unresolved reference
2017 · External reference
10.1007/978-3-030-02768-1_17
10.1007/978-3-030-02768-1_17 · 2018 · External reference
Unresolved reference
2018 · External reference
10.1090/dimacs/026/25
10.1090/dimacs/026/25 · 1996 · External reference
Unresolved reference
1992 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
1998 · External reference
Unresolved reference
2000 · External reference
10.1017/cbo9780511809682
10.1017/cbo9780511809682 · 2004 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2010 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2009 · External reference
Unresolved reference
1996 · External reference
Unresolved reference
2008 · External reference
Sequence to Sequence Learning with Neural Networks
2014 · External reference
Unresolved reference
2018 · External reference
CAQE and QuAbS: Abstraction based QBF solvers
10.3233/sat190121 · 2019 · External reference
An instance-weighting method to induce costsensitive trees
10.1109/tkde.2002.1000348 · 2002 · External reference
Unresolved reference
2020 · External reference
10.1007/0-387-34239-7
10.1007/0-387-34239-7 · 2006 · External reference
Graph Kernels
2010 · External reference
Are Random Forests Truly the Best Classifiers?
2016 · External reference
How to tune the RBF SVM hyperparameters? An empirical evaluation of 18 search algorithms
10.1007/s10462-021-10011-5 · 2021 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2014 · External reference
Simple statistical gradient-following algorithms for connectionist reinforcement learning
10.1023/a:1022672621406 · 1992 · External reference
Unresolved reference
1964 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2007 · External reference
Unresolved reference
2012 · External reference
SATzilla: Portfolio-based Algorithm Selection for SAT
10.1613/jair.2490 · 2008 · External reference
SATzilla2009: an Automatic Algorithm Portfolio for SAT
2009 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2019 · External reference
Unresolved reference
2012 · External reference
Unresolved reference
2001 · External reference
