On the public citation graph
Two ways of formalizing grammars
0 signed · 34 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-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00630516openalex-snapshot
The logic of unification in grammar
inferredcites →https://doi.org/10.1007/bfb0031367openalex-snapshot
Natural Language Communication with Computers
inferredcites →https://doi.org/10.1016/0304-3975(93)90218-iopenalex-snapshot
Finite-model theory - a personal perspective
inferredcites →https://doi.org/10.1016/0743-1066(92)90039-6openalex-snapshot
Feature-constraint logics for unification grammars
inferredcites →https://doi.org/10.1017/cbo9780511530098openalex-snapshot
The Logic of Typed Feature Structures
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.3115/980431.980518openalex-snapshot
The semantics of grammar formalisms seen as computer languages
inferredcites →https://doi.org/10.3115/981131openalex-snapshot
Proceedings of the 24th annual meeting on Association for Computational Linguistics -
inferredcites →https://doi.org/10.3115/981175.981188openalex-snapshot
A logical version of functional grammar
inferredcites →https://doi.org/10.3115/981311openalex-snapshot
Proceedings of the 21st annual meeting on Association for Computational Linguistics -
inferredcites →https://doi.org/10.3115/981823.981845openalex-snapshot
Expressing disjunctive and negative feature constraints with classical first-order logic
inferredcites →https://doi.org/10.3115/992507.992531openalex-snapshot
Computational linguistics in 1990
inferredcites →https://doi.org/10.5860/choice.31-0987openalex-snapshot
The logical approach to syntax: foundations, specifications, and implementations of theories of government and binding
inferredcites →https://doi.org/10.7551/mitpress/10174.003.0004openalex-snapshot
Some Notes on Economy of Derivation and Representation
inferredcites →https://doi.org/10.7551/mitpress/2123.001.0001openalex-snapshot
Constraint-Based Grammar Formalisms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781405198431.wbeal0858openalex-snapshot
Natural Language Processing and Language Learning
inferred← citeshttps://doi.org/10.1002/9781405198431.wbeal0858.pub2openalex-snapshot
Natural Language Processing and Language learning
inferred← citeshttps://doi.org/10.1007/978-3-7091-0594-8_18openalex-snapshot
Interface Metaphors and Their Roles in Travel Related Websites
inferred← citeshttps://doi.org/10.1007/978-3-7091-0594-8_19openalex-snapshot
Virtual Museums: New added-value for Museums Web Sites
inferred← citeshttps://doi.org/10.1007/bfb0052159openalex-snapshot
A family of decidable feature logics which support HPSG-style set and list constructions
inferred← citeshttps://doi.org/10.1016/b0-08-044854-2/01960-xopenalex-snapshot
Declarative Models of Syntax
inferred← citeshttps://doi.org/10.1017/cbo9781139649414.024openalex-snapshot
Learner corpora and natural language processing
inferred← citeshttps://doi.org/10.1109/ssci.2016.7849914openalex-snapshot
HERMES: A high-level policy language for high-granularity enterprise-wide secure browser configuration management
inferred← citeshttps://doi.org/10.3115/976909.979677openalex-snapshot
Representing constraints with automata
inferred← citeshttps://doi.org/10.3115/979617.979677openalex-snapshot
Representing constraints with automata
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.