On the public citation graph

A Clausal Normal Form Translation for FOOL

https://doi.org/10.29007/ltkk
0 signed · 26 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-1-4899-5327-8_25openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-319-08587-6_28openalex-snapshot
StarExec: A Cross-Community Infrastructure for Logic Solving
inferredcites →https://doi.org/10.1007/978-3-319-20615-8_5openalex-snapshot
A First Class Boolean Sort in First-Order Theorem Proving and TPTP
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_13openalex-snapshot
A Decision Procedure for (Co)datatypes in SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-319-40229-1_25openalex-snapshot
Effective Normalization Techniques for HOL
inferredcites →https://doi.org/10.1007/978-3-642-37651-1_10openalex-snapshot
Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_7openalex-snapshot
Computing Tiny Clause Normal Forms
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-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/s10817-009-9143-8openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferredcites →https://doi.org/10.1016/b978-044450813-3/50008-4openalex-snapshot
Computing Small Clause Normal Forms
inferredcites →https://doi.org/10.29007/2b5dopenalex-snapshot
qbf2epr: A Tool for Generating EPR Formulas from QBF
inferredcites →https://doi.org/10.29007/dzfzopenalex-snapshot
New Techniques in Clausal Form Generation
inferredcites →https://doi.org/10.29007/vv21openalex-snapshot
Playing with Quantified Satisfaction
inferredcites →https://doi.org/10.48550/arxiv.1510.02642openalex-snapshot
An Instantiation-Based Approach for Solving Quantified Linear Arithmetic

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-79876-5_22openalex-snapshot
Superposition with First-class Booleans and Inprocessing Clausification
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_23openalex-snapshot
Superposition for Full Higher-order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_10openalex-snapshot
Extending a High-Performance Prover to Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-66845-1_19openalex-snapshot
Triggerless Happy
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_27openalex-snapshot
A FOOLish Encoding of the Next State Relations of Imperative Programs
inferred← citeshttps://doi.org/10.1007/s10009-021-00639-7openalex-snapshot
Extending a brainiac prover to lambda-free higher-order logic
inferred← citeshttps://doi.org/10.1007/s10817-018-09502-yopenalex-snapshot
Scalable Fine-Grained Proofs for Formula Processing
inferred← citeshttps://doi.org/10.1007/s10817-022-09649-9openalex-snapshot
Superposition for Higher-Order Logic
inferred← citeshttps://doi.org/10.1016/j.scico.2017.08.001openalex-snapshot
Exploration of language specifications by compilation to first-order logic
inferred← citeshttps://doi.org/10.3233/aic-210235openalex-snapshot
The CADE-28 Automated Theorem Proving System Competition – CASC-28
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13744openalex-snapshot
The Horn Non-Clausal Class and its Polynomiality
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.