![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 19 matches
- 2011
- Maxime Amblard:
Encoding Phases Using Commutativity and Non-commutativity in a Logical Framework. LACL 2011: 1-16 - Carlos Areces
, Santiago Figueira, Daniel Gorín:
Using Logic in the Generation of Referring Expressions. LACL 2011: 17-32 - Arno Bastenhof:
Polarized Classical Non-associative Lambek Calculus and Formal Semantics. LACL 2011: 33-48 - Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95 - Jeroen Bransen:
The Product-Free Lambek-Grishin Calculus Is NP-Complete. LACL 2011: 49-63 - Robin Cooper:
Copredication, Quantification and Frames. LACL 2011: 64-79 - Thomas Graf:
Closure Properties of Minimalist Derivation Tree Languages. LACL 2011: 96-111 - Makoto Kanazawa, Jens Michaelis
, Sylvain Salvati, Ryo Yoshinaka
:
Well-Nestedness Properly Subsumes Strict Derivational Minimalism. LACL 2011: 112-128 - Gregory M. Kobele:
Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages. LACL 2011: 129-144 - Staffan Larsson
:
Do Dialogues Have Content? LACL 2011: 145-158 - Zhaohui Luo:
Contextual Analysis of Word Meanings in Type-Theoretical Semantics. LACL 2011: 159-174 - Glyn Morrill:
Logic Programming of the Displacement Calculus. LACL 2011: 175-189 - Yuri Ozaki, Daisuke Bekki:
Conditional Logic Cb and Its Tableau System. LACL 2011: 190-204 - Carl Pollard:
Are (Linguists') Propositions (Topos) Propositions? LACL 2011: 205-218 - Sai Qian, Maxime Amblard:
Event in Compositional Dynamic Semantics. LACL 2011: 219-234 - Noémie-Fleur Sandillon-Rezer, Richard Moot:
Using Tree Transducers for Grammatical Inference. LACL 2011: 235-250 - Ryo Yoshinaka
, Makoto Kanazawa:
Distributional Learning of Abstract Categorial Grammars. LACL 2011: 251-266 - Richard Zuber:
Some Generalised Comparative Determiners. LACL 2011: 267-281 - Sylvain Pogodalla, Jean-Philippe Prost
:
Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011, Montpellier, France, June 29 - July 1, 2011. Proceedings. Lecture Notes in Computer Science 6736, Springer 2011, ISBN 978-3-642-22220-7 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-18 18:39 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint