On the public citation graph

The semantics of answer literals

https://doi.org/10.1007/bf00247669
0 signed · 20 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-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-662-35338-7openalex-snapshot
A Survey of Binary Systems
inferredcites →https://doi.org/10.1007/bf00244359openalex-snapshot
Robbins algebra: Conditions that make a near-boolean algebra boolean
inferredcites →https://doi.org/10.1007/bf00244497openalex-snapshot
OTTER and the Moufang identity problem
inferredcites →https://doi.org/10.1016/0004-3702(71)90003-8openalex-snapshot
Extracting information from resolution proof trees
inferredcites →https://doi.org/10.1016/0021-8693(92)90162-fopenalex-snapshot
Absorption and idempotency criteria for a problem in near-Boolean algebras
inferredcites →https://doi.org/10.1016/0898-1221(94)00212-4openalex-snapshot
The shortest single axioms for groups of exponent 4
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1090/s0002-9947-1933-1501684-xopenalex-snapshot
New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell’s Principia mathematica
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11560647_11openalex-snapshot
Upside-Down Transformation in SOL/Connection Tableaux and Its Application
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_21openalex-snapshot
Minimal Answer Computation and SOL
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_18openalex-snapshot
Program Synthesis in Saturation
inferred← citeshttps://doi.org/10.1007/978-3-540-25957-2_36openalex-snapshot
Consequence Finding in Default Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_47openalex-snapshot
Negative Hyper-resolution as Procedural Semantics of Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1007/s10817-006-9044-zopenalex-snapshot
Searching for Shortest Single Axioms for Groups of Exponent 6
inferred← citeshttps://doi.org/10.1007/s10844-006-5450-2openalex-snapshot
Consequence finding and computing answers with defaults
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103246openalex-snapshot
A formalised theorem in the partition calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80595-4openalex-snapshot
Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments
inferred← citeshttps://doi.org/10.1023/b:amai.0000034529.83643.ceopenalex-snapshot
Speculative Computation Through Consequence-Finding in Multi-Agent Environments
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.