Exploració per autor "Kuznetsov, Stepan"

Ara es mostren els items 1-2 de 2

    • A polynomial-time algorithm for the Lambek calculus with brackets of bounded order 

      Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre (Dagstuhl Publishing, 2017)
      Text en actes de congrés
      Accés obert
      Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth ...

    • Count-invariance including exponentials 

      Kuznetsov, Stepan; Morrill, Glyn; Valentín Fernández Gallart, José Oriol (Association for Computational Linguistics, 2017)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      We define infinitary count-invariance for categorial logic, extending countinvariance for multiplicatives (van Benthem, 1991) and additives and bracket modalities (Valentín et al., 2013) to include exponentials. This ...