On the public citation graph
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
0 signed · 39 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.1016/0004-3702(91)90078-xopenalex-snapshot
Attributive concept descriptions with complements
inferredcites →https://doi.org/10.1016/0743-1066(92)90039-6openalex-snapshot
Feature-constraint logics for unification grammars
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
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.1090/s0273-0979-1982-14963-1openalex-snapshot
The word problem and the isomorphism problem for groups
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.2307/414493openalex-snapshot
The mental representation of grammatical relations . Edited by Joan Bresnan. Cambridge, MA: MIT Press, 1982. Pp. 874. $35.00.
inferredcites →https://doi.org/10.3115/991635.991695openalex-snapshot
An algorithm for functional uncertainty
inferredcites →https://doi.org/10.3115/991635.991696openalex-snapshot
Constituent coordination in Lexical-Functional Grammar
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_39openalex-snapshot
Reasoning with Individuals for the Description Logic $\mathcal{SHIQ}$
inferred← citeshttps://doi.org/10.1007/10722086_1openalex-snapshot
Tableau Algorithms for Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_11openalex-snapshot
Practical Reasoning for Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_12openalex-snapshot
Complexity of Terminological Reasoning 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/978-3-7908-1772-0_19openalex-snapshot
Retrieval of Semistructured Web Data
inferred← citeshttps://doi.org/10.1007/bf00984931openalex-snapshot
Is there a genuine modal perspective on feature structures?
inferred← citeshttps://doi.org/10.1007/s10992-014-9329-3openalex-snapshot
On the Decidability Status of Fuzzy A ℒ C $\mathcal {A}\mathcal {L}\mathcal {C}$ with General Concept Inclusions
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.1016/0304-3975(94)00188-oopenalex-snapshot
A complete and recursive feature theory
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00033-gopenalex-snapshot
A complete axiomatization of a theory with feature and arity constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2004.02.002openalex-snapshot
-connections of abstract description systems
inferred← citeshttps://doi.org/10.1016/j.artint.2004.06.002openalex-snapshot
Decidability of SHIQ with complex role inclusion axioms
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.jsc.2010.01.007openalex-snapshot
Anti-patterns for rule-based languages
inferred← citeshttps://doi.org/10.1023/a:1013882326814openalex-snapshot
An Overview of Tableau Algorithms for Description Logics
inferred← citeshttps://doi.org/10.1023/a:1021880119937openalex-snapshot
Ordering and Path Constraints over Semistructured Data
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.239openalex-snapshot
Practical reasoning for very expressive description logics
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2005.00273.xopenalex-snapshot
AUTOMATICALLY GENERATING TREE ADJOINING GRAMMARS FROM ABSTRACT SPECIFICATIONS
inferred← citeshttps://doi.org/10.25368/2022.124openalex-snapshot
Decidability of SHIQ with Complex Role Inclusion Axioms
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.257openalex-snapshot
Role-Value Maps and General Concept Inclusions in the Description Logic FL₀
inferred← citeshttps://doi.org/10.25368/2022.81openalex-snapshot
A Description Logic with Transitive and Converse Roles and Role Hierarchies
inferred← citeshttps://doi.org/10.25368/2022.94openalex-snapshot
A Description Logic with Transitive and Converse Roles, Role Hierarchies and Qualifying Number Restrictions
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.