On the public citation graph

A sound and complete CG proof procedure combining projections with analytic tableaux

0 signed · 19 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-52337-6_18openalex-snapshot

Tableau calculus for order sorted logic

inferredcites →https://doi.org/10.1007/3-540-60161-9_47openalex-snapshot

Conceptual graphs and first-order logic

inferredcites →https://doi.org/10.1007/3-540-61534-2_16openalex-snapshot

Sound and complete forward and backward chainings of graph rules

inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot

First-Order Logic

inferredcites →https://doi.org/10.1007/bf00985573openalex-snapshot

Direct deductive computation on discourse representation structures

inferredcites →https://doi.org/10.1007/bfb0024065openalex-snapshot

Computational Aspects of an Order-Sorted Logic with Term Declarations

inferredcites →https://doi.org/10.1016/0004-3702(87)90037-3openalex-snapshot

Conceptual structures: Information processing in mind and machine

inferredcites →https://doi.org/10.1111/0824-7935.00066openalex-snapshot

Logic for Nested Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-84628-102-4_10openalex-snapshot

A combinatorial approach to conceptual graph projection checking

inferred← citeshttps://doi.org/10.1007/10722280_12openalex-snapshot

Knowledge Representation and Reasonings Based on Graph Homomorphism

inferred← citeshttps://doi.org/10.1007/11524564_24openalex-snapshot

A New Method to Interrogate and Check UML Class Diagrams

inferred← citeshttps://doi.org/10.1007/3-540-48659-3_31openalex-snapshot

Tractable and Decidable Fragments of Conceptual Graphs

inferred← citeshttps://doi.org/10.1007/3-540-48659-3_32openalex-snapshot

Dynamic Semantics for Conceptual Graphs

inferred← citeshttps://doi.org/10.1007/bfb0027909openalex-snapshot

The CORALI project: From conceptual graphs to conceptual graphs via labelled graphs

inferred← citeshttps://doi.org/10.1007/bfb0054920openalex-snapshot

Fuzzy order-sorted logic programming in conceptual graphs with a sound and complete proof procedure

inferred← citeshttps://doi.org/10.1007/bfb0054925openalex-snapshot

Ontologies and conceptual structures

inferred← citeshttps://doi.org/10.25368/2022.86openalex-snapshot

The Guarded Fragment of Conceptual Graphs

inferred← citeshttps://doi.org/10.25368/2022.87openalex-snapshot

On the Relation between Conceptual Graphs and Description Logics

inferred← citeshttps://doi.org/10.4018/jismd.2011100104openalex-snapshot

CbSSDF

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.