AbstractThis article provides detailed constructions demonstrating that the class of indexed grammars introduced as a simple extension of context-free grammars has essentially the same expressive power as the class of logic programs with unary predicates and functions and exactly one variable symbol.Some additional considerations are concerned with parsing procedures
. Logic programs share with context-free grammars a strong reliance on well-formedness conditions. T...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one p...
In this dissertation we give the first proper mathemat-ical treatment of the semantics of Boolean gr...
AbstractThis article provides detailed constructions demonstrating that the class of indexed grammar...
Indexed grammars are a generalization of context-free grammars and recognize a proper subset of cont...
The strong generative capacity of a certain type of indexed grammar is investigated within a model-t...
This paper defines the grammar class of sequentially indexed grammars. Sequentially indexed grammars...
Indexed languages are interesting in computational linguistics because they are the least class of l...
National audienceThe logical approach to categorial grammars renews ideas that go back to the fiftie...
This paper presents a possibility to extend the formalism of linear indexed grammars. The extension ...
International audienceIn the tradition of Model Theoretic Syntax, we propose a logical approach to t...
AbstractA new generalization of context-free grammars is introduced: Boolean grammars allow the use ...
This book is a study of the logical and computational properties of structure-preserving categorial ...
Constrained grammatical system have been the object of study in computational linguistics over the l...
In this paper we study the relationship between Attribute Grammars and Logic Programs, concentrating...
. Logic programs share with context-free grammars a strong reliance on well-formedness conditions. T...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one p...
In this dissertation we give the first proper mathemat-ical treatment of the semantics of Boolean gr...
AbstractThis article provides detailed constructions demonstrating that the class of indexed grammar...
Indexed grammars are a generalization of context-free grammars and recognize a proper subset of cont...
The strong generative capacity of a certain type of indexed grammar is investigated within a model-t...
This paper defines the grammar class of sequentially indexed grammars. Sequentially indexed grammars...
Indexed languages are interesting in computational linguistics because they are the least class of l...
National audienceThe logical approach to categorial grammars renews ideas that go back to the fiftie...
This paper presents a possibility to extend the formalism of linear indexed grammars. The extension ...
International audienceIn the tradition of Model Theoretic Syntax, we propose a logical approach to t...
AbstractA new generalization of context-free grammars is introduced: Boolean grammars allow the use ...
This book is a study of the logical and computational properties of structure-preserving categorial ...
Constrained grammatical system have been the object of study in computational linguistics over the l...
In this paper we study the relationship between Attribute Grammars and Logic Programs, concentrating...
. Logic programs share with context-free grammars a strong reliance on well-formedness conditions. T...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one p...
In this dissertation we give the first proper mathemat-ical treatment of the semantics of Boolean gr...
DOI
Add to ORKG