On the public citation graph

Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions

https://doi.org/10.1007/bfb0095434
0 signed · 56 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/bf00993470openalex-snapshot
The Learnability of Description Logics with Equality Constraints
inferredcites →https://doi.org/10.1007/bf02127747openalex-snapshot
Using automata theory for characterizing the semantics of terminological cycles
inferredcites →https://doi.org/10.1007/bfb0013522openalex-snapshot
A terminological knowledge representation system with complete inference algorithms
inferredcites →https://doi.org/10.1007/bfb0095434openalex-snapshot
Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
inferredcites →https://doi.org/10.1016/0898-1221(92)90139-9openalex-snapshot
The KL-ONE family
inferredcites →https://doi.org/10.1016/b978-1-4832-0771-1.50018-7openalex-snapshot
TERMINOLOGICAL CYCLES
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50108-1openalex-snapshot
Learning the CLASSIC Description Logic: Theoretical and Experimental Results
inferredcites →https://doi.org/10.1023/a:1022626200450openalex-snapshot
A Polynomial Approach to the Constructive Induction of Structural Knowledge
inferredcites →https://doi.org/10.1093/logcom/6.1.33openalex-snapshot
A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages
inferredcites →https://doi.org/10.1145/66926.66932openalex-snapshot
CLASSIC: a structural data model for objects
inferredcites →https://doi.org/10.1145/67544.66932openalex-snapshot
CLASSIC: a structural data model for objects
inferredcites →https://doi.org/10.25368/2022.75openalex-snapshot
Characterizing the semantics of terminological cycles in ALN using finite automata

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470588222.ch8openalex-snapshot
Machine Learning Methods for Ontology Mining
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/10722280_20openalex-snapshot
Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis
inferred← citeshttps://doi.org/10.1007/11551263_5openalex-snapshot
Subsumption in $\mathcal{EL}$ w.r.t. Hybrid TBoxes
inferred← citeshttps://doi.org/10.1007/11779568_68openalex-snapshot
Tractable Feature Generation Through Description Logics with Value and Number Restrictions
inferred← citeshttps://doi.org/10.1007/3-540-36468-4_8openalex-snapshot
Learnability of Description Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45049-1_57openalex-snapshot
A Least Common Subsumer Operation for an Expressive Description Logic
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_4openalex-snapshot
Approximating Most Specific Concepts in Description Logics with Existential Restrictions
inferred← citeshttps://doi.org/10.1007/3-540-45751-8_7openalex-snapshot
On the Problem of Computing Small Representations of Least Common Subsumers
inferred← citeshttps://doi.org/10.1007/3-540-45876-x_2openalex-snapshot
DAML+OIL: A Reason-able Web Ontology Language
inferred← citeshttps://doi.org/10.1007/3-540-46695-9_19openalex-snapshot
Computing Least Common Subsumers in Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-48238-5_7openalex-snapshot
Computing Probabilistic Least Common Subsumers in Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-24651-0_24openalex-snapshot
Applying Formal Concept Analysis to Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_34openalex-snapshot
Computing the Least Common Subsumer w.r.t. a Background Terminology
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_15openalex-snapshot
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic $\mathcal{EL}$
inferred← citeshttps://doi.org/10.1007/978-3-540-36562-4_20openalex-snapshot
Semantic Indexing for Intelligent Browsing of Distributed Data
inferred← citeshttps://doi.org/10.1007/978-3-540-39451-8_6openalex-snapshot
The Instance Problem and the Most Specific Concept in the Description Logic $\mathcal{EL}$ w.r.t. Terminological Cycles with Descriptive Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-39592-8_84openalex-snapshot
Discovering Structures in Video Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-45091-7_8openalex-snapshot
Computing the Least Common Subsumer in the Description Logic $\mathcal{EL}$ w.r.t. Terminological Cycles with Descriptive Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_14openalex-snapshot
Matching in Hybrid Terminologies
inferred← citeshttps://doi.org/10.1007/978-3-540-92673-3_1openalex-snapshot
Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-13486-9_7openalex-snapshot
Categorize by: Deductive Aggregation of Semantic Web Query Results
inferred← citeshttps://doi.org/10.1007/978-3-642-15300-6_3openalex-snapshot
Microtheories for Spatial Data Infrastructures - Accounting for Diversity of Local Conceptualizations at a Global Level
inferred← citeshttps://doi.org/10.1007/s00287-011-0534-yopenalex-snapshot
What’s new in Description Logics
inferred← citeshttps://doi.org/10.1007/s11225-005-3705-5openalex-snapshot
Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions
inferred← citeshttps://doi.org/10.1016/j.jal.2006.03.002openalex-snapshot
Computing the least common subsumer w.r.t. a background terminology
inferred← citeshttps://doi.org/10.1016/j.jbi.2004.09.001openalex-snapshot
Modeling a description logic vocabulary for cancer research
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80016-4openalex-snapshot
13 Description logic
inferred← citeshttps://doi.org/10.1080/09528130512331315927openalex-snapshot
Towards structure discovering in video data
inferred← citeshttps://doi.org/10.1109/ichis.2004.39openalex-snapshot
Downward Refinement in the ALN Description Logic
inferred← citeshttps://doi.org/10.1109/mis.2002.1039835openalex-snapshot
DAML+OIL: an ontology language for the Semantic Web
inferred← citeshttps://doi.org/10.1145/1458082.1458190openalex-snapshot
Finding informative commonalities in concept collections
inferred← citeshttps://doi.org/10.1145/2541928.2541937openalex-snapshot
model[NL]generation
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9076openalex-snapshot
Converting Instance Checking to Subsumption: A Rethink for Object Queries over Practical Ontologies
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5675openalex-snapshot
Least General Generalizations in Description Logic: Verification and Existence
inferred← citeshttps://doi.org/10.1613/jair.702openalex-snapshot
What's in an Attribute? Consequences for the Least Common Subsumer
inferred← citeshttps://doi.org/10.25368/2022.110openalex-snapshot
Computing Least Common Subsumers in ALEN
inferred← citeshttps://doi.org/10.25368/2022.167openalex-snapshot
Model-based Most Specific Concepts in Description Logics with Value Restrictions
inferred← citeshttps://doi.org/10.25368/2022.176openalex-snapshot
Completion-based computation of most specific concepts with limited role-depth for EL and Prob-EL⁰¹
inferred← citeshttps://doi.org/10.29007/scbwopenalex-snapshot
Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-739openalex-snapshot
Partial and Informative Common Subsumers in Description Logics
inferred← citeshttps://doi.org/10.4018/jwsr.2010100103openalex-snapshot
Satisfying End User Constraints in Service Composition by Applying Stochastic Search Methods
inferred← citeshttps://doi.org/10.5555/777092.777214openalex-snapshot
Reviewing the design of DAML+OIL: an ontology language for the semantic web
showing the first 43 of 44 · page through all 44
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.