Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Anne Preller"'
Autor:
Anne Preller
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 171, Iss Proc. QPL 2013, Pp 113-131 (2014)
The paper relates two variants of semantic models for natural language, logical functional models and compositional distributional vector space models, by transferring the logic and reasoning from the logical to the distributional models. The geomet
Externí odkaz:
https://doaj.org/article/7f5266096d214bbfadcb8b374a497ce4
Autor:
Anne, Preller, author
Publikováno v:
Quantum Physics and Linguistics : A Compositional, Diagrammatic Discourse, 2013.
Externí odkaz:
https://doi.org/10.1093/acprof:oso/9780199646296.003.0009
Autor:
Wojciech Buszkowski, Anne Preller
Publikováno v:
Studia Logica. 87:139-144
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89cd0bf0a73361fd0cc56e80f73d969a
https://doi.org/10.1007/s11225-007-9082-5
https://doi.org/10.1007/s11225-007-9082-5
Autor:
Anne Preller, Sylvain Degeilh
Publikováno v:
Journal of Logic, Language and Information
Journal of Logic, Language and Information, Springer Verlag, 2005, 14 (4), pp.423-444
Journal of Logic, Language and Information, Springer Verlag, 2005, 14 (4), pp.423-444
We study mathematical and algorithmic properties of Lambek's pregroups and illustrate them by the French noun phrase. An algorithm of complexity n3 to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup gram
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41a6dd00df376fdd28a47353b1b9e614
https://doi.org/10.1007/s10849-005-1242-2
https://doi.org/10.1007/s10849-005-1242-2
Autor:
Anne Preller
Publikováno v:
Journal of Applied Logic
Journal of Applied Logic, Elsevier, 2014, 12, pp.88-108. ⟨10.1016/j.jal.2013.08.001⟩
Journal of Applied Logic, Elsevier, 2014, 12, pp.88-108. ⟨10.1016/j.jal.2013.08.001⟩
International audience; Biproduct dagger categories serve as models for natural language. In particular, the biproduct dagger category of finite dimensional vector spaces over the field of real numbers accommodates both the extensional models of pred
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdea6b444fe0e469783b058d512101a3
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00860382
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00860382
Autor:
Anne Preller
Publikováno v:
Studia Logica
Studia Logica, Springer Verlag (Germany), 2007, 87 (2/3), pp.171-197. ⟨10.1007/s11225-007-9087-0⟩
Studia Logica, Springer Verlag (Germany), 2007, 87 (2/3), pp.171-197. ⟨10.1007/s11225-007-9087-0⟩
International audience; Pregroup grammars have a cubic recognition algorithm. Here, we define a correct and complete recognition and parsing algorithm and give sufficient conditions for the algorithm to run in linear time. These conditions are satisf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e9fc5ba0e14614ccb28ac02c42165d0
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00184257
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00184257
Autor:
Patrice Duroux, Anne Preller
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 33:227-257
Using an inductive definition of normal terms of the theory of Cartesian Closed Categories with a given graph of distinguished morphisms, we give a reduction free proof of the decidability of this theory. This inductive definition enables us to show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0434a014e90a1bb2a0c0a09d4fd5aa09
https://doi.org/10.1051/ita:1999115
https://doi.org/10.1051/ita:1999115
Publikováno v:
Computational Intelligence. 14:335-357
We study the expressiveness of Nested Graphs, an extension of conceptual graphs. Nesting is introduced as a formal version of the intuitive “zooming in” on descriptions of individuals. Projections are defined inductively as the formal tool for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cd7f51c592cd768fac07716380f6461
https://doi.org/10.1111/0824-7935.00066
https://doi.org/10.1111/0824-7935.00066
Autor:
Geneviève Simonet, Anne Preller
Publikováno v:
Mathematical Structures in Computer Science. 6:387-408
We establish functional completeness of Locally Cartesian Closed Categories by axiomatising the theory of LCCC's in a constructive style. As a consequence we show that there is essentially only one interpretation of Martin-Löf's theory of types with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48627c7e5f78a3ebedfb5d0e7b22ddfd
https://doi.org/10.1017/s0960129500001080
https://doi.org/10.1017/s0960129500001080