On the public citation graph

Heterogeneous Heuristic Optimisation and Scheduling for First-Order Theorem Proving

https://doi.org/10.1007/978-3-030-81097-9_8
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-030-05318-5_1openalex-snapshot
Hyperparameter Optimization
inferredcites →https://doi.org/10.1007/978-3-030-51054-1_24openalex-snapshot
Implementing Superposition in iProver (System Description)
inferredcites →https://doi.org/10.1007/978-3-540-71070-7_24openalex-snapshot
iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
inferredcites →https://doi.org/10.1007/978-3-642-02959-2_10openalex-snapshot
SPASS Version 3.5
inferredcites →https://doi.org/10.1007/978-3-642-25566-3_10openalex-snapshot
Instance-Based Parameter Tuning via Search Trajectory Similarity Clustering
inferredcites →https://doi.org/10.1007/978-3-642-34413-8_14openalex-snapshot
Quantifying Homogeneity of Instance Sets for Algorithm Configuration
inferredcites →https://doi.org/10.1007/978-3-642-34413-8_5openalex-snapshot
Parallel Algorithm Configuration
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_28openalex-snapshot
E-MaLeS 1.1
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_1openalex-snapshot
First-Order Theorem Proving and Vampire
inferredcites →https://doi.org/10.1007/978-3-642-45221-5_49openalex-snapshot
System Description: E 1.8
inferredcites →https://doi.org/10.1007/s10817-006-9032-3openalex-snapshot
MPTP 0.2: Design, Implementation, and Initial Experiments
inferredcites →https://doi.org/10.1007/s10817-014-9301-5openalex-snapshot
Machine Learning for First-Order Theorem Proving
inferredcites →https://doi.org/10.1007/s10817-017-9407-7openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferredcites →https://doi.org/10.1016/j.eswa.2008.01.039openalex-snapshot
A simple and fast algorithm for K-medoids clustering
inferredcites →https://doi.org/10.1145/2939672.2939785openalex-snapshot
XGBoost
inferredcites →https://doi.org/10.1145/3018610.3018619openalex-snapshot
BliStrTune: hierarchical invention of theorem proving strategies
inferredcites →https://doi.org/10.1613/jair.2490openalex-snapshot
SATzilla: Portfolio-based Algorithm Selection for SAT
inferredcites →https://doi.org/10.29007/36dtopenalex-snapshot
Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers
inferredcites →https://doi.org/10.29007/8n7mopenalex-snapshot
BliStr: The Blind Strategymaker
inferredcites →https://doi.org/10.29007/gms9openalex-snapshot
Breeding Theorem Proving Heuristics with Genetic Algorithms
inferredcites →https://doi.org/10.29007/xghjopenalex-snapshot
Automated Invention of Strategies and Term Orderings for Vampire

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4532643openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-81097-9openalex-snapshot
Intelligent Computer Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_11openalex-snapshot
Ground Joinability and Connectedness in the Superposition Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_18openalex-snapshot
Targeted Configuration of an SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_4openalex-snapshot
Learning Guided Automated Reasoning: A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_12openalex-snapshot
Regularization in Spider-Style Strategy Discovery and Schedule Construction
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_13openalex-snapshot
Lemma Discovery and Strategies for Automated Induction
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_5openalex-snapshot
A Higher-Order Vampire (Short Paper)
inferred← citeshttps://doi.org/10.1016/j.ins.2022.11.128openalex-snapshot
Fully reusing clause deduction algorithm based on standard contradiction separation rule
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.111238openalex-snapshot
A complementary ratio based clause selection method for contradiction separation dynamic deduction
inferred← citeshttps://doi.org/10.1109/iske60036.2023.10481258openalex-snapshot
Active Deduction Heuristic Algorithm of Standard Contradiction Separation Rule Based on Reinforcement Learning
inferred← citeshttps://doi.org/10.3233/aic-210235openalex-snapshot
The CADE-28 Automated Theorem Proving System Competition – CASC-28
inferred← citeshttps://doi.org/10.3233/aic-220244openalex-snapshot
The 11th IJCAR automated theorem proving system competition – CASC-J11
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.