On the public citation graph
Consistency checking reduced to satisfiability of concepts in terminological systems
0 signed · 38 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.1006/inco.1997.2625openalex-snapshot
The Complexity of Concept Languages
inferredcites →https://doi.org/10.1007/bfb0013522openalex-snapshot
A terminological knowledge representation system with complete inference algorithms
inferredcites →https://doi.org/10.1007/bfb0016445openalex-snapshot
Reasoning and Revision in Hybrid Representation Systems
inferredcites →https://doi.org/10.1016/0004-3702(90)90087-gopenalex-snapshot
Terminological reasoning is inherently intractable
inferredcites →https://doi.org/10.1016/0004-3702(91)90078-xopenalex-snapshot
Attributive concept descriptions with complements
inferredcites →https://doi.org/10.1016/0004-3702(92)90076-aopenalex-snapshot
The complexity of existential quantification in concept languages
inferredcites →https://doi.org/10.1016/s0364-0213(85)80014-8openalex-snapshot
An Overview of the KL‐ONE Knowledge Representation System*
inferredcites →https://doi.org/10.1111/j.1467-8640.1987.tb00176.xopenalex-snapshot
Expressiveness and tractability in knowledge representation and reasoning1
inferredcites →https://doi.org/10.1145/122296.122309openalex-snapshot
Inside the LOOM description classifier
inferredcites →https://doi.org/10.1145/122296.122313openalex-snapshot
The CLASSIC knowledge representation system
inferredcites →https://doi.org/10.22028/d291-24787openalex-snapshot
Qualifying number restrictions in concept languages
inferredcites →https://doi.org/10.22028/d291-24896openalex-snapshot
Embedding defaults into terminological knowledge representation formalisms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-31072-x_1openalex-snapshot
Nonstandard Inferences in Description Logics: The Story So Far
inferred← citeshttps://doi.org/10.1007/10722086_1openalex-snapshot
Tableau Algorithms for Description Logics
inferred← citeshttps://doi.org/10.1007/11532231_13openalex-snapshot
The OWL Instance Store: System Description
inferred← citeshttps://doi.org/10.1007/978-3-540-73099-6_4openalex-snapshot
Axiom Pinpointing in General Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-642-15034-0_2openalex-snapshot
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$
inferred← citeshttps://doi.org/10.1007/s13218-016-0459-3openalex-snapshot
Decidability and Complexity of Fuzzy Description Logics
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50025-4openalex-snapshot
Reasoning in Expressive Description Logics
inferred← citeshttps://doi.org/10.1016/j.artint.2003.08.001openalex-snapshot
Combining interval-based temporal reasoning with general TBoxes
inferred← citeshttps://doi.org/10.1016/j.fss.2015.07.013openalex-snapshot
Reasoning in Fuzzy Description Logics using Automata
inferred← citeshttps://doi.org/10.1016/j.ijar.2013.07.006openalex-snapshot
Consistency reasoning in lattice-based fuzzy Description Logics
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferred← citeshttps://doi.org/10.1023/a:1013882326814openalex-snapshot
An Overview of Tableau Algorithms for Description Logics
inferred← citeshttps://doi.org/10.1093/logcom/exn058openalex-snapshot
Axiom Pinpointing in General Tableaux
inferred← citeshttps://doi.org/10.1109/services-1.2008.57openalex-snapshot
XML Schema Representation and Reasoning: A Description Logic Method
inferred← citeshttps://doi.org/10.1613/jair.2372openalex-snapshot
Conjunctive Query Answering for the Description Logic SHIQ
inferred← citeshttps://doi.org/10.25368/2022.165openalex-snapshot
Blocking and Pinpointing in Forest Tableaux
inferred← citeshttps://doi.org/10.25368/2022.166openalex-snapshot
Pinpointing in Terminating Forest Tableaux
inferred← citeshttps://doi.org/10.25368/2022.204openalex-snapshot
The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106031openalex-snapshot
Complexity Results and Practical Algorithms for Logics in Knowledge Representation
inferred← citeshttps://doi.org/10.5555/3031929.3031959openalex-snapshot
Decidable Gödel description logics without the finitely-valued model property
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-135openalex-snapshot
Description logics over lattices with multi-valued ontologies
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.