On the public citation graph
Robbins algebra: Conditions that make a near-boolean algebra boolean
0 signed · 36 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-10009-1_17openalex-snapshot
Hyperparamodulation: A refinement of paramodulation
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/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bfb0000054openalex-snapshot
Procedure implementation through demodulation and related tricks
inferredcites →https://doi.org/10.1016/0004-3702(84)90054-7openalex-snapshot
A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1088/0022-3727/21/3/020openalex-snapshot
Determination of the effective contact radius between a conducting sphere and a thin metallic film
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.1109/tc.1976.1674696openalex-snapshot
Problems and Experiments for and with Automated Theorem-Proving Programs
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.1305/ndjfl/1093870311openalex-snapshot
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1999.0362openalex-snapshot
Goals and Benchmarks for Automated Map Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_6openalex-snapshot
Experiments with Roo, a parallel automated deduction system
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_54openalex-snapshot
Problems on the generation of finite models
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_8openalex-snapshot
Handling equality in logic programming via basic folding
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_71openalex-snapshot
Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_57openalex-snapshot
Well-behaved search and the Robbins problem
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_6openalex-snapshot
The Clause-Diffusion theorem prover Peers-mcd (system description)
inferred← citeshttps://doi.org/10.1007/bf00252178openalex-snapshot
Using hints to increase the effectiveness of an automated reasoning program: Case studies
inferred← citeshttps://doi.org/10.1007/bf00881872openalex-snapshot
Automated proofs of equality problems in Overbeek's competition
inferred← citeshttps://doi.org/10.1023/a:1005843212881openalex-snapshot
Solution of the Robbins Problem
inferred← citeshttps://doi.org/10.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferred← citeshttps://doi.org/10.1023/a:1018932114059openalex-snapshot
A taxonomy of parallel strategies for deduction
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.1145/266670.266696openalex-snapshot
Experiments with subdivision of search in distributed theorem proving
inferred← citeshttps://doi.org/10.2172/565657openalex-snapshot
Experiments with the hot list strategy
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.