On the public citation graph

6th Conference on Automated Deduction

https://doi.org/10.1007/bfb0000048
0 signed · 31 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/bfb0000065openalex-snapshot
Knowledge retrieval as limited inference

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.0346openalex-snapshot
Program Development Schemata as Derived Rules
inferred← citeshttps://doi.org/10.1006/jsco.2000.0466openalex-snapshot
On the Role of OpenMath in Interactive Mathematical Documents
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_152openalex-snapshot
Automatic proofs in mathematical logic and analysis
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/bf02745521openalex-snapshot
Reuse of proofs in software verification
inferred← citeshttps://doi.org/10.1007/s001650050052openalex-snapshot
Interactive Proof Critics
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90079-qopenalex-snapshot
Rippling: A heuristic for guiding inductive proofs
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00108-5openalex-snapshot
Infinite complete group presentations
inferred← citeshttps://doi.org/10.1016/0167-9260(86)90005-2openalex-snapshot
Computer algebra and logic programming
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50027-8openalex-snapshot
Resolution Decision Procedures
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.005openalex-snapshot
Querying incomplete information in RDF with SPARQL
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103307openalex-snapshot
On the limits of forgetting in Answer Set Programming
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.03.004openalex-snapshot
Satisfiability modulo theories for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.024openalex-snapshot
Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.004openalex-snapshot
Narrowing and Rewriting Logic: from Foundations to Applications
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.053openalex-snapshot
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.113openalex-snapshot
On the Expressivity of Minimal Generic Quantification
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.118openalex-snapshot
Reasoning in Abella about Structural Operational Semantics Specifications
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.020openalex-snapshot
Formalizing Operational Semantic Specifications in Logic
inferred← citeshttps://doi.org/10.1016/s0020-7373(85)80008-0openalex-snapshot
Probabilistic versus fuzzy production rules in expert systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70234-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0743-1066(85)80002-9openalex-snapshot
Computing protected circumscription
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82522-8openalex-snapshot
Agent Based Mathematical Reasoning
inferred← citeshttps://doi.org/10.1017/s0960129520000031openalex-snapshot
Computing knowledge in equational extensions of subterm convergent theories
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1993.tb00300.xopenalex-snapshot
CLAUSE MANAGEMENT SYSTEMS (CMS)
inferred← citeshttps://doi.org/10.1145/3131851.3131856openalex-snapshot
Conditional narrowing modulo SMT and axioms
inferred← citeshttps://doi.org/10.1177/003754978704900404openalex-snapshot
A Prolog-based expert system for modeling with partial differential equations
inferred← citeshttps://doi.org/10.3390/ijms232214081openalex-snapshot
Robust Classification Using Posterior Probability Threshold Computation Followed by Voronoi Cell Based Class Assignment Circumventing Pitfalls of Bayesian Analysis of Biomedical Data
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.