On the public citation graph
Using automata theory for characterizing the semantics of terminological cycles
0 signed · 81 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/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/bfb0015772openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
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/0020-0190(82)90065-5openalex-snapshot
Fixed point theorems and semantics: a folk tale
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-9236(87)90120-5openalex-snapshot
Recent developments in NIKL
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1016/0304-3975(86)90136-2openalex-snapshot
On the complementation of Büchi automata
inferredcites →https://doi.org/10.1016/0304-3975(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(89)90088-1openalex-snapshot
Recursive query processing: the power of logic
inferredcites →https://doi.org/10.1016/0304-4076(90)90045-uopenalex-snapshot
Recent developments in DEA
inferredcites →https://doi.org/10.1016/0306-4379(83)90024-8openalex-snapshot
On recursive axioms in deductive databases
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/b978-0-934613-53-8.50024-8openalex-snapshot
AN ESSENTIAL HYBRID REASONING SYSTEM: KNOWLEDGE AND SYMBOL LEVEL ACCOUNTS OF KRYPTON
inferredcites →https://doi.org/10.1016/b978-1-4832-0771-1.50018-7openalex-snapshot
TERMINOLOGICAL CYCLES
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
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.1109/sfcs.1985.27openalex-snapshot
Fixed-point extensions of first-order logic
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.122313openalex-snapshot
The CLASSIC knowledge representation system
inferredcites →https://doi.org/10.1145/567752.567763openalex-snapshot
Universality of data retrieval languages
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
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-24902openalex-snapshot
Augmenting concept languages by transitive closure of roles : an alternative to terminological cycles
inferredcites →https://doi.org/10.22028/d291-25004openalex-snapshot
Terminological cycles and the ropositional μ-calculus
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/3-540-36109-x_5openalex-snapshot
A Class-Based Logic Language for Ontologies
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_15openalex-snapshot
Unification in a Description Logic with Transitive Closure of Roles
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_8openalex-snapshot
Description Logics for Conceptual Data Modeling
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_5openalex-snapshot
The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics
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/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-45091-7_7openalex-snapshot
Description Logics for Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_53openalex-snapshot
Generalized Satisfiability for the Description Logic $\mathcal{ALC}$
inferred← citeshttps://doi.org/10.1007/bfb0095434openalex-snapshot
Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
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.1007/s11432-008-0101-6openalex-snapshot
Satisfiability and reasoning mechanism of terminological cycles in description logic % MathType!MTEF!2!1!+- % feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqipC0df9qqqrpepC0xbbL8F4rqqrpepeea0xe9Lq-lc9 %…
inferred← citeshttps://doi.org/10.1007/s13218-016-0459-3openalex-snapshot
Decidability and Complexity of Fuzzy Description Logics
inferred← citeshttps://doi.org/10.1007/s13218-020-00651-0openalex-snapshot
Role-Value Maps and General Concept Inclusions in the Minimal Description Logic with Value Restrictions or Revisiting Old Skeletons in the DL Cupboard
inferred← citeshttps://doi.org/10.1007/s13218-020-00664-9openalex-snapshot
Quantitative Variants of Language Equations and their Applications to 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.fss.2015.07.013openalex-snapshot
Reasoning in Fuzzy Description Logics using Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.009openalex-snapshot
Generalized satisfiability for the description logic ALC
inferred← citeshttps://doi.org/10.1016/s0096-3003(00)00025-4openalex-snapshot
Pathology of collective doxa. Automata models
inferred← citeshttps://doi.org/10.1016/s0306-4379(03)00003-6openalex-snapshot
Description logics with aggregates and concrete domains
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferred← citeshttps://doi.org/10.1017/s0960129519000185openalex-snapshot
Extensions of unification modulo ACUI
inferred← citeshttps://doi.org/10.1093/logcom/9.3.295openalex-snapshot
Representing and reasoning on XML documents: a description logic approach
inferred← citeshttps://doi.org/10.1109/ictemsys.2015.7110811openalex-snapshot
Similarity measures for FL0 concept descriptions from an automata-theoretic point of view
inferred← citeshttps://doi.org/10.1117/12.477535openalex-snapshot
Line and net pattern segmentation using shape modeling
inferred← citeshttps://doi.org/10.1145/762471.762472openalex-snapshot
Description logics for semantic query optimization in object-oriented database systems
inferred← citeshttps://doi.org/10.11606/d.45.2021.tde-02092021-131750openalex-snapshot
Pseudo-contraction operations for description logics
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.22028/d291-25860openalex-snapshot
Saturation-based decision procedures for extensions of the guarded fragment
inferred← citeshttps://doi.org/10.25368/2022.107openalex-snapshot
Revised Version of LTCS-Report 99-12: Rewriting Concepts Using Terminologies - Revisited
inferred← citeshttps://doi.org/10.25368/2022.120openalex-snapshot
Terminological cycles in a description logic with existential restrictions
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.257openalex-snapshot
Role-Value Maps and General Concept Inclusions in the Description Logic FL₀
inferred← citeshttps://doi.org/10.25368/2022.80openalex-snapshot
Structural Subsumption Considered from an Automata-Theoretic Point of View
inferred← citeshttps://doi.org/10.25368/2022.82openalex-snapshot
Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
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.29352/mill0204.05.00151openalex-snapshot
Ontology elements identified in different nursing classification systems
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.02483openalex-snapshot
LCS and MSC Reasoning of Hybrid Terminological Cycles in Description Logic eL
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03215openalex-snapshot
Fixpoint Semantics and Reasoning of Terminological Cycles in Description Logic eLN
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03255openalex-snapshot
Semantics and Reasoning of Description Logic mALCQO
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2008.00016openalex-snapshot
Condition of Cyclic ALCN-Tbox Exists Model
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2008.00185openalex-snapshot
Semantics and Reasoning of Terminological Cycles in Description Logic FL-
inferred← citeshttps://doi.org/10.48550/arxiv.1001.4255openalex-snapshot
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
inferred← citeshttps://doi.org/10.48550/arxiv.1401.6359openalex-snapshot
Subsumption Checking in Conjunctive Coalgebraic Fixpoint 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.