On the public citation graph
A modal perspective on the computational complexity of attribute value grammar
0 signed · 118 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.1002/malq.19930390136openalex-snapshot
Prefinitely axiomatizable modal and intermediate logics
inferredcites →https://doi.org/10.1007/3-540-12689-9_103openalex-snapshot
Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)
inferredcites →https://doi.org/10.1007/3-540-53904-2_101openalex-snapshot
Query optimization using rewrite rules
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_16openalex-snapshot
Completeness Theorems for Logics of Feature Structures
inferredcites →https://doi.org/10.1007/978-94-009-7066-3openalex-snapshot
Handbook of Philosophical Logic
inferredcites →https://doi.org/10.1007/978-94-015-8242-1_2openalex-snapshot
Modal Logic and Attribute Value Structures
inferredcites →https://doi.org/10.1007/978-94-015-8242-1_8openalex-snapshot
Dyadic Modalities and Lambek Calculus
inferredcites →https://doi.org/10.1007/bf00370389openalex-snapshot
The formalization of Interpretability
inferredcites →https://doi.org/10.1007/bf00630516openalex-snapshot
The logic of unification in grammar
inferredcites →https://doi.org/10.1007/bf01050788openalex-snapshot
Sequence semantics for dynamic predicate logic
inferredcites →https://doi.org/10.1007/bf01051767openalex-snapshot
Generalized quantifiers and modal logic
inferredcites →https://doi.org/10.1007/bf01387407openalex-snapshot
The unprovability of small inconsistency
inferredcites →https://doi.org/10.1007/bf01418780openalex-snapshot
Undecidability and nonperiodicity for tilings of the plane
inferredcites →https://doi.org/10.1007/bf01624079openalex-snapshot
Arithmetic analogues of McAloon's unique Rosser sentences
inferredcites →https://doi.org/10.1007/bf03024028openalex-snapshot
The War of the frogs and the mice, or the crisis of themathematische annalen
inferredcites →https://doi.org/10.1007/bfb0018462openalex-snapshot
The logic of objective knowledge and rational belief
inferredcites →https://doi.org/10.1016/0004-3702(91)90060-wopenalex-snapshot
On the justification of Dempster's rule of combination
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0022-0000(82)90018-6openalex-snapshot
Deterministic propositional dynamic logic: Finite models, complexity, and completeness
inferredcites →https://doi.org/10.1016/0168-0072(89)90032-8openalex-snapshot
Varieties of complex algebras
inferredcites →https://doi.org/10.1016/0168-0072(93)e0079-4openalex-snapshot
A course on bimodal provability logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90126-0openalex-snapshot
Determinism and looping in combinatory PDL
inferredcites →https://doi.org/10.1016/0743-1066(92)90039-6openalex-snapshot
Feature-constraint logics for unification grammars
inferredcites →https://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferredcites →https://doi.org/10.1016/0898-1221(92)90146-9openalex-snapshot
Subsumption computed algebraically
inferredcites →https://doi.org/10.1016/s0020-7373(89)80032-xopenalex-snapshot
A computationally efficient approximation of Dempster-Shafer theory
inferredcites →https://doi.org/10.1016/s0304-0208(08)73075-5openalex-snapshot
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
inferredcites →https://doi.org/10.1017/cbo9780511530098openalex-snapshot
The Logic of Typed Feature Structures
inferredcites →https://doi.org/10.1075/cilt.75.08steopenalex-snapshot
6. Generalized Phrase Structure Grammar
inferredcites →https://doi.org/10.1090/memo/0066openalex-snapshot
The undecidability of the domino problem
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
inferredcites →https://doi.org/10.1093/logcom/2.1.5openalex-snapshot
Using the Universal Modality: Gains and Questions
inferredcites →https://doi.org/10.1111/j.1755-2567.1970.tb00428.xopenalex-snapshot
An approach to tense logic1
inferredcites →https://doi.org/10.1112/jlms/s2-47.2.193openalex-snapshot
Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/4904.4993openalex-snapshot
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
inferredcites →https://doi.org/10.1305/ndjfl/1093635077openalex-snapshot
Peano's smart children: a provability logical study of systems with built-in consistency.
inferredcites →https://doi.org/10.1305/ndjfl/1093635332openalex-snapshot
A simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$.
inferredcites →https://doi.org/10.2307/2185122openalex-snapshot
Generalized Phrase Structure Grammar.
inferredcites →https://doi.org/10.2307/2275330openalex-snapshot
Splittings and the finite model property
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/980431.980518openalex-snapshot
The semantics of grammar formalisms seen as computer languages
inferredcites →https://doi.org/10.3115/981131.981166openalex-snapshot
A logical semantics for feature structures
inferredcites →https://doi.org/10.3115/992507.992531openalex-snapshot
Computational linguistics in 1990
inferredcites →https://doi.org/10.3233/fi-1987-10207openalex-snapshot
Process Algebra Semantics for Queues
inferredcites →https://doi.org/10.7551/mitpress/4286.003.0014openalex-snapshot
Actions under Presuppositions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2852openalex-snapshot
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
inferred← citeshttps://doi.org/10.1007/3-540-60437-5_10openalex-snapshot
PDL-based framework for reasoning about actions
inferred← citeshttps://doi.org/10.1007/3-540-60437-5_19openalex-snapshot
$$\mathcal{T}\mathcal{R}\mathcal{D}\mathcal{L}$$ : A language for conceptual modelling in Information Systems Engineering
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_117openalex-snapshot
Tableaux and algorithms for Propositional Dynamic Logic with Converse
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_21openalex-snapshot
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_17openalex-snapshot
A Hybrid Logic of Knowledge Supporting Topological Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-72665-4_27openalex-snapshot
Reasoning About Operations on Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_34openalex-snapshot
A Universally Defined Undecidable Unimodal Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_4openalex-snapshot
Discipline as Logic: Treating Labels as First Class Citizens
inferred← citeshttps://doi.org/10.1007/978-94-015-8242-1_2openalex-snapshot
Modal Logic and Attribute Value Structures
inferred← citeshttps://doi.org/10.1007/978-94-015-8879-9_2openalex-snapshot
Modal Logic and Model-Theoretic Syntax
inferred← citeshttps://doi.org/10.1007/bf00159345openalex-snapshot
Fibred semantics for feature-based grammar logic
inferred← citeshttps://doi.org/10.1007/bf00173700openalex-snapshot
Eliminating “converse” from converse PDL
inferred← citeshttps://doi.org/10.1007/bf00984931openalex-snapshot
Is there a genuine modal perspective on feature structures?
inferred← citeshttps://doi.org/10.1007/s10849-008-9060-yopenalex-snapshot
Optionality, Scope, and Licensing: An Application of Partially Ordered Categories
inferred← citeshttps://doi.org/10.1007/s11168-008-9046-6openalex-snapshot
Scope and Situation Binding in LTAG Using Semantic Unification
inferred← citeshttps://doi.org/10.1007/s11225-018-09842-1openalex-snapshot
Complexity of the Universal Theory of Modal Algebras
inferred← citeshttps://doi.org/10.1007/s11225-023-10093-yopenalex-snapshot
Variations on the Kripke Trick
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.056openalex-snapshot
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00070-9openalex-snapshot
EXPtime tableaux for ALC
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.006openalex-snapshot
Algebras and General Frames
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.007openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.012openalex-snapshot
A Guide to the Literature
inferred← citeshttps://doi.org/10.1023/a:1008247127922openalex-snapshot
The Complexity of Modellability in Finite and Computable Signatures of a Constraint Logic for Head-Driven Phrase Structure Grammar
inferred← citeshttps://doi.org/10.1023/a:1018988913388openalex-snapshot
Hybridizing concept languages
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.339openalex-snapshot
Representation, reasoning, and relational structures: a hybrid logic manifesto
inferred← citeshttps://doi.org/10.1093/jigpal/8.5.653openalex-snapshot
The computational complexity of hybrid temporal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzad002openalex-snapshot
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness
inferred← citeshttps://doi.org/10.1093/jigpal/jzy014openalex-snapshot
Complexity and expressivity of propositional dynamic logics with finitely many variables
inferred← citeshttps://doi.org/10.1093/logcom/exaa060openalex-snapshot
Complexity of finite-variable fragments of products withK
inferred← citeshttps://doi.org/10.1093/logcom/exab030openalex-snapshot
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exab080openalex-snapshot
Complexity of finite-variable fragments of products with non-transitive modal logics
inferred← citeshttps://doi.org/10.1093/logcom/exad078openalex-snapshot
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
inferred← citeshttps://doi.org/10.1093/logcom/exae077openalex-snapshot
Polytime embedding of intuitionistic modal logics into their one-variable fragments
inferred← citeshttps://doi.org/10.1109/iat.2005.56openalex-snapshot
Complexity of a theory of collective attitudes in teamwork
inferred← citeshttps://doi.org/10.1109/lics.1994.316074openalex-snapshot
Complexity transfer for modal logic
inferred← citeshttps://doi.org/10.1109/lics.2002.1029843openalex-snapshot
Description logics: foundations for class-based knowledge representation
inferred← citeshttps://doi.org/10.1145/3278681.3278718openalex-snapshot
On complexity of propositional linear-time temporal logic with finitely many variables
inferred← citeshttps://doi.org/10.1145/3410886.3410889openalex-snapshot
Computational properties of the logic of partial quasiary predicates
inferred← citeshttps://doi.org/10.1515/9783110806786.83openalex-snapshot
Principle languages and principle-based parsing
inferred← citeshttps://doi.org/10.22028/d291-24990openalex-snapshot
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
inferred← citeshttps://doi.org/10.3115/976744.976749openalex-snapshot
Decidability and undecidability in stand-alone feature logics
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0845openalex-snapshot
A Simplest Undecidable Modal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.cmp-lg/9503022openalex-snapshot
Assessing Complexity Results in Feature Theories
inferred← citeshttps://doi.org/10.7282/t30k27cjopenalex-snapshot
Formal and Computational Aspects of Optimality-theoretic Syntax
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.