On the public citation graph

SET-VAR

https://doi.org/10.1007/bf00881869
0 signed · 29 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-52885-7_88openalex-snapshot
Str+ve $$\subseteq$$ : The Str+ve-based subset prover
inferredcites →https://doi.org/10.1007/978-94-011-3488-0_2openalex-snapshot
METEORs: High Performance Theorem Provers using Model Elimination
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/bf01457985openalex-snapshot
Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321592.321603openalex-snapshot
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11532231_3openalex-snapshot
Reasoning in Extensional Type Theory with Equality
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_33openalex-snapshot
Solving for Set Variables in Higher-Order Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_5openalex-snapshot
Replacement Rules with Definition Detection
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_40openalex-snapshot
Automatic Generation of Proof Search Strategies for Second-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_15openalex-snapshot
Predicate Logic with Sequence Variables and Sequence Function Symbols
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_14openalex-snapshot
Solving Equations Involving Sequence Variables and Sequence Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_13openalex-snapshot
Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems
inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferred← citeshttps://doi.org/10.1007/bf00881873openalex-snapshot
Set theory for verification: I. From foundations to functions
inferred← citeshttps://doi.org/10.1007/bfb0054272openalex-snapshot
Selectively instantiating definitions
inferred← citeshttps://doi.org/10.1007/s10817-013-9283-8openalex-snapshot
Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems
inferred← citeshttps://doi.org/10.1016/0303-2647(94)01453-eopenalex-snapshot
A precondition prover for analogy
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.12.002openalex-snapshot
Solving equations with sequence variables and sequence functions
inferred← citeshttps://doi.org/10.1016/j.scico.2003.04.007openalex-snapshot
XVCL: a mechanism for handling variants in software product lines
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00175-9openalex-snapshot
The calculus of constructions as a framework for proof search with set variable instantiation
inferred← citeshttps://doi.org/10.1023/a:1005712718688openalex-snapshot
A Tribute to Woody Bledsoe
inferred← citeshttps://doi.org/10.1109/apsec.2003.1254364openalex-snapshot
An XVCL approach to handling variants: a KWIC product line example
inferred← citeshttps://doi.org/10.1145/1131313.1131317openalex-snapshot
Decidability results for sets with atoms
inferred← citeshttps://doi.org/10.1609/aimag.v17i1.1207openalex-snapshot
Woody Bledsoe: His Life and Legacy
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.