On the public citation graph
Extensions of concept languages for a mechanical engineering application
0 signed · 53 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.1007/3-540-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/978-3-642-71385-9_7openalex-snapshot
Data Models in Knowledge Representation Systems: A Case Study
inferredcites →https://doi.org/10.1007/978-3-642-76071-6_5openalex-snapshot
Hybrid Inferences in KL-ONE-based Knowledge Representation Systems
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bfb0016445openalex-snapshot
Reasoning and Revision in Hybrid Representation Systems
inferredcites →https://doi.org/10.1007/bfb0019000openalex-snapshot
Combining terminological and rule-based reasoning for abstraction processes
inferredcites →https://doi.org/10.1016/0004-3702(91)90078-xopenalex-snapshot
Attributive concept descriptions with complements
inferredcites →https://doi.org/10.1016/b978-1-4832-0771-1.50018-7openalex-snapshot
TERMINOLOGICAL CYCLES
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.1016/s0747-7171(88)80003-8openalex-snapshot
The complexity of linear problems in fields
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08555-9openalex-snapshot
A variant of a recursively unsolvable problem
inferredcites →https://doi.org/10.1093/comjnl/36.5.450openalex-snapshot
Applying Linear Quantifier Elimination
inferredcites →https://doi.org/10.1109/caia.1988.196082openalex-snapshot
Experience with K-REP: an object-centered knowledge representation language
inferredcites →https://doi.org/10.1109/mex.1987.4307092openalex-snapshot
Organizing Knowledge in a Complex Financial Domain
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.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.22028/d291-24776openalex-snapshot
Terminological cycles in KL-ONE-based knowledge representation languages
inferredcites →https://doi.org/10.22028/d291-24817openalex-snapshot
A scheme for integrating concrete domains into concept languages
inferredcites →https://doi.org/10.22028/d291-24902openalex-snapshot
Augmenting concept languages by transitive closure of roles : an alternative to terminological cycles
inferredcites →https://doi.org/10.22028/d291-24917openalex-snapshot
FEAT-REP : representing features in CAD/CAM
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11551263_4openalex-snapshot
A New n-Ary Existential Quantifier in Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_4openalex-snapshot
The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_5openalex-snapshot
NExpTime-Complete Description Logics with Concrete Domains
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_17openalex-snapshot
Cooperative Recognition of Interdatabase Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_24openalex-snapshot
Description Logics with Concrete Domains and General Concept Inclusions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_11openalex-snapshot
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_14openalex-snapshot
Description Logics as Ontology Languages for the Semantic Web
inferred← citeshttps://doi.org/10.1007/bfb0019000openalex-snapshot
Combining terminological and rule-based reasoning for abstraction processes
inferred← citeshttps://doi.org/10.1007/s10817-022-09626-2openalex-snapshot
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains
inferred← citeshttps://doi.org/10.1016/j.artint.2004.02.002openalex-snapshot
-connections of abstract description systems
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.009openalex-snapshot
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
inferred← citeshttps://doi.org/10.1016/j.imavis.2007.08.013openalex-snapshot
On scene interpretation with description logics
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferred← citeshttps://doi.org/10.1145/1024922.1024925openalex-snapshot
NEXP TIME-complete description logics with concrete domains
inferred← citeshttps://doi.org/10.1145/3605098.3635984openalex-snapshot
The Abstract Expressive Power of First-Order and Description Logics with Concrete Domains
inferred← citeshttps://doi.org/10.1145/3699839.3699840openalex-snapshot
Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability
inferred← citeshttps://doi.org/10.1613/jair.1542openalex-snapshot
Keys, Nominals, and Concrete Domains
inferred← citeshttps://doi.org/10.1613/jair.919openalex-snapshot
Fusions of Description Logics and Abstract Description Systems
inferred← citeshttps://doi.org/10.22028/d291-24869openalex-snapshot
COLAB : a hybrid knowledge representation and compilation laboratory
inferred← citeshttps://doi.org/10.24963/kr.2020/61openalex-snapshot
An ExpTime Upper Bound for ALC with Integers
inferred← citeshttps://doi.org/10.25368/2022.130openalex-snapshot
A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics
inferred← citeshttps://doi.org/10.25368/2022.151openalex-snapshot
A New n-ary Existential Quantifier in Description Logics
inferred← citeshttps://doi.org/10.25368/2022.259openalex-snapshot
Using model theory to find w-admissible concrete domains
inferred← citeshttps://doi.org/10.25368/2022.70openalex-snapshot
Number Restrictions on Complex Roles in Description Logics
inferred← citeshttps://doi.org/10.29352/mill0204.05.00151openalex-snapshot
Ontology elements identified in different nursing classification systems
inferred← citeshttps://doi.org/10.48550/arxiv.2006.02078openalex-snapshot
An ExpTime Upper Bound for $\mathcal{ALC}$ with Integers (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106031openalex-snapshot
Complexity Results and Practical Algorithms for Logics in Knowledge Representation
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.