| Publication | Date of Publication | Type |
|---|
Categorial dependency grammars with iterated sequences
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) | 2017-02-22 | Paper |
On harmonic CCG and pregroup grammars
Logical Aspects of Computational Linguistics | 2014-06-24 | Paper |
On associative Lambek calculus extended with basic proper axioms
Lecture Notes in Computer Science | 2014-05-08 | Paper |
\(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable
Electronic Notes in Theoretical Computer Science | 2013-05-24 | Paper |
Two models of learning iterated dependencies
Formal Grammar | 2012-11-02 | Paper |
Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
Theoretical Computer Science | 2012-08-09 | Paper |
Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
Implementation and Application of Automata | 2011-07-29 | Paper |
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
A modular and parameterized presentation of pregroup calculus
Information and Computation | 2010-04-22 | Paper |
On categorial grammars as logical information systems
Formal Concept Analysis | 2010-04-14 | Paper |
Fully Lexicalized Pregroup Grammars
Logic, Language, Information and Computation | 2009-03-10 | Paper |
Pregroup Calculus as a Logic Functor
Logic, Language, Information and Computation | 2009-03-10 | Paper |
Optional and Iterated Types for Pregroup Grammars
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Learnability of pregroup grammars
Studia Logica | 2008-01-21 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Theoretical Computer Science | 2006-04-28 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
| scientific article; zbMATH DE number 2019598 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 1786551 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 862960 (Why is no real title available?) | 1996-04-02 | Paper |
Rewrite rule systems for modal propositional logic
The Journal of Logic Programming | 1992-08-13 | Paper |
| scientific article; zbMATH DE number 4164138 (Why is no real title available?) | 1989-01-01 | Paper |
