On the public citation graph

Formalizing Bachmair and Ganzinger's Ordered Resolution Prover

https://doi.org/10.29007/pn71
0 signed · 32 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/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_46openalex-snapshot
AVATAR: The Architecture for First-Order Theorem Provers
inferredcites →https://doi.org/10.1007/978-3-319-66167-4_1openalex-snapshot
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-319-94205-6_7openalex-snapshot
Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_31openalex-snapshot
Certification of Termination Proofs Using CeTA
inferredcites →https://doi.org/10.1007/978-3-642-27940-9_3openalex-snapshot
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
inferredcites →https://doi.org/10.1007/bf00244278openalex-snapshot
Towards mechanical metamathematics
inferredcites →https://doi.org/10.1007/bfb0012820openalex-snapshot
First-order theorem proving using conditional rewrite rules
inferredcites →https://doi.org/10.1007/s10817-013-9284-7openalex-snapshot
Locales: A Module System for Mathematical Theories
inferredcites →https://doi.org/10.1007/s10817-016-9391-3openalex-snapshot
Soundness and Completeness Proofs by Coinductive Methods
inferredcites →https://doi.org/10.1007/s10817-017-9447-zopenalex-snapshot
Formalization of the Resolution Calculus for First-Order Logic
inferredcites →https://doi.org/10.1016/b978-044450813-3/50004-7openalex-snapshot
Resolution Theorem Proving
inferredcites →https://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferredcites →https://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot
Rewrite-based Equational Theorem Proving with Selection and Simplification
inferredcites →https://doi.org/10.1145/3176245.3167080openalex-snapshot
A verified SAT solver with watched literals using imperative HOL
inferredcites →https://doi.org/10.24963/ijcai.2017/667openalex-snapshot
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
inferredcites →https://doi.org/10.29007/4z1mopenalex-snapshot
Logtk : A Logic ToolKit for Automated Reasoning and its Implementation
inferredcites →https://doi.org/10.3929/ethz-b-000197713openalex-snapshot
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
inferredcites →https://doi.org/10.4230/lipics.fscd.2017.19openalex-snapshot
Infinite Runs in Abstract Completion
inferredcites →https://doi.org/10.48550/arxiv.1207.3441openalex-snapshot
Isabelle/jEdit --- a Prover IDE within the PIDE framework

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-33716-2_16openalex-snapshot
TPL: A Trust Policy Language
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_18openalex-snapshot
A Comprehensive Framework for Saturation Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_26openalex-snapshot
Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-030-90138-7_2openalex-snapshot
Interactive Theorem Proving for Logic and Information
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_7openalex-snapshot
An Isabelle/HOL Formalization of the SCL(FOL) Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_8openalex-snapshot
SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_17openalex-snapshot
A Stepwise Refinement Proof that SCL(FOL) Simulates Ground Ordered Resolution
inferred← citeshttps://doi.org/10.1007/s10817-017-9447-zopenalex-snapshot
Formalization of the Resolution Calculus for First-Order Logic
inferred← citeshttps://doi.org/10.1007/s10817-022-09621-7openalex-snapshot
A Comprehensive Framework for Saturation Theorem Proving
inferred← citeshttps://doi.org/10.1145/3293880.3294087openalex-snapshot
Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)
inferred← citeshttps://doi.org/10.70675/4e757310z5358z41cbza43ez56c7ad4c869aopenalex-snapshot
Stronger SMT Solvers for Proof Assistants : Proofs, Quantifier Simplification, Strategy Schedules
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.