A modal perspective on the computational complexity of attribute value grammar
type: Item
instance of: scholarly article
title: A modal perspective on the computational complexity of attribute value grammar
zbMATH Open document ID: 0793.03018
DOI: 10.1007/BF01050635
author: Patrick Blackburn
author: Edith Hemaspaandra
published in: Journal of Logic, Language and Information
publication date: 1994-02-22T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T50
zbMATH DE Number: 501099
zbMATH Keywords: unification formalisms
zbMATH Keywords: attribute value grammar
zbMATH Keywords: propositional modal logic
zbMATH Keywords: modal satisfiability
zbMATH Keywords: Kripke models
zbMATH Keywords: fragments of propositional dynamic logic
MaRDI profile type: Publication
cites work: Q4039803
cites work: Deterministic propositional dynamic logic: finite models, complexity, and completeness
cites work: Subsumption computed algebraically
cites work: The Logic of Typed Feature Structures
cites work: Propositional dynamic logic of regular programs
cites work: Q3478385
cites work: Determinism and looping in combinatory PDL
cites work: Modal logic with names
cites work: Varieties of complex algebras
cites work: Using the Universal Modality: Gains and Questions
cites work: Q3313253
cites work: Q4343990
cites work: Q3026978
cites work: The logic of unification in grammar
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: PDL with data constants
cites work: An essay in combinatory dynamic logic
cites work: Q5556395
cites work: Q4012244
cites work: The complexity of propositional linear temporal logics
cites work: Feature-constraint logics for unification grammars
full work available at URL: https://doi.org/10.1007/bf01050635
OpenAlex ID: W338087933
description: scientific article; zbMATH DE number 501099