On the public citation graph

Deriving inference rules for terminological logics

https://doi.org/10.1007/bfb0023423
0 signed · 18 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.1006/inco.1997.2625openalex-snapshot
The Complexity of Concept Languages
inferredcites →https://doi.org/10.1007/978-94-009-7066-3_2openalex-snapshot
Systems of Deduction
inferredcites →https://doi.org/10.1007/bfb0016445openalex-snapshot
Reasoning and Revision in Hybrid Representation Systems
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0890-5401(91)90023-uopenalex-snapshot
Simple consequence relations
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11574620_26openalex-snapshot
On Logical Consequence for Collections of OWL Documents
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_23openalex-snapshot
On intuitionistic query answering in description bases
inferred← citeshttps://doi.org/10.1007/3-540-60343-3_32openalex-snapshot
Parallelizing description logics
inferred← citeshttps://doi.org/10.1007/bf00974203openalex-snapshot
Knowledge-based disambiguation for machine translation
inferred← citeshttps://doi.org/10.1007/bf01535840openalex-snapshot
The F-logic approach for description languages
inferred← citeshttps://doi.org/10.1016/s0923-0459(97)80010-9openalex-snapshot
Parallel propagation in the description-logic system FLEX
inferred← citeshttps://doi.org/10.1109/69.469829openalex-snapshot
Description logics in data management
inferred← citeshttps://doi.org/10.1109/icsc.2014.34openalex-snapshot
Partitioning OWL Knowledge Bases for Parallel Reasoning
inferred← citeshttps://doi.org/10.1613/jair.584openalex-snapshot
Extensible Knowledge Representation: the Case of Description Reasoners
inferred← citeshttps://doi.org/10.7282/t3-drq1-tp08openalex-snapshot
Explaining subsumption in description logics
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.