On the public citation graph
Subgoal alternation in model elimination
0 signed · 24 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferredcites →https://doi.org/10.1007/3-540-58156-1_59openalex-snapshot
SETHEO V3.2: Recent developments
inferredcites →https://doi.org/10.1007/3-540-61511-3_97openalex-snapshot
Optimizing proof search in model elimination
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-1-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferredcites →https://doi.org/10.1007/bf00297245openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/bf00881947openalex-snapshot
Controlled integration of the cut rule into connection tableau calculi
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722086_23openalex-snapshot
Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_7openalex-snapshot
Deduction as a Cross-Sectional Technology The DFG Focus Programme on Deduction
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_7openalex-snapshot
FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_15openalex-snapshot
Properties and Relations of Tableau and Connection Calculi
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_3openalex-snapshot
First-Order Tableau Methods
inferred← citeshttps://doi.org/10.1007/bfb0054259openalex-snapshot
Elimination of equality via transformation with ordering constraints
inferred← citeshttps://doi.org/10.1007/bfb0054273openalex-snapshot
Using matings for pruning connection tableaux
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00225-2openalex-snapshot
Towards the qualitative, plan-based simulation of international crises
inferred← citeshttps://doi.org/10.1023/a:1005808119103openalex-snapshot
SETHEO and E-SETHEO - The CADE-13 Systems
inferred← citeshttps://doi.org/10.1023/a:1006006930186openalex-snapshot
The CADE-14 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1015134701251openalex-snapshot
Connection Tableau Calculi with Disjunctive Constraints
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.