標(biāo)題: Titlebook: Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016); 9th International Co Maxime Amblard,Philippe de Gro [打印本頁] 作者: bradycardia 時(shí)間: 2025-3-21 17:22
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)影響因子(影響力)
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)影響因子(影響力)學(xué)科排名
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)網(wǎng)絡(luò)公開度
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)被引頻次
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)被引頻次學(xué)科排名
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)年度引用
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)年度引用學(xué)科排名
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)讀者反饋
書目名稱Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)讀者反饋學(xué)科排名
作者: modish 時(shí)間: 2025-3-21 23:24
Nicholas Asher,Soumya Paule of political uncertainty at Delhi attracted to Jaunpur a large number of Islamic scholars and noblemen, transforming the city into a center of Islamic arts, literature, and religious activity. The generous patronage of the Sharqi dynasty played a key role in this regional cultural upsurge, support作者: instulate 時(shí)間: 2025-3-22 02:41
William Babonnaud,Laura Kallmeyer,Rainer Osswald Sanskrit narrative by Kalhana—in the late eighteenth century (followed by its partial translation by H. H. Wilson in 1829) led to its possible designation as the only Sanskrit text from the precolonial period that could legitimately be accorded the status of “history.” By the start of the twentieth作者: 攤位 時(shí)間: 2025-3-22 08:30
Daisuke Bekki,Ai Kawazoet much of the work with knowledge representation in this context focuses on application domains where one can only hope for an incomplete characterization of such domains, this methodological constraint has proven to be quite challenging since, in essence, the focus is on tractable approximate and n作者: 征服 時(shí)間: 2025-3-22 12:47
Wojciech Buszkowskit much of the work with knowledge representation in this context focuses on application domains where one can only hope for an incomplete characterization of such domains, this methodological constraint has proven to be quite challenging since, in essence, the focus is on tractable approximate and n作者: MUMP 時(shí)間: 2025-3-22 16:25
Gabriel Gaudreaultidering that much of the work with knowledge representation in this context focuses on application domains where one can only hope for an incomplete characterization of such domains, this methodological constraint has proven to be quite challenging since, in essence, the focus is on tractable approx作者: 混雜人 時(shí)間: 2025-3-22 20:08 作者: 脖子 時(shí)間: 2025-3-22 22:29 作者: Electrolysis 時(shí)間: 2025-3-23 03:40 作者: 小教堂 時(shí)間: 2025-3-23 09:21
Reinhard Muskens,Mehrnoosh Sadrzadehed into a series of condition-action rules (when . condition occurs, then take . action). In computer vision it was found that there is too wide a gap between raw image data and any kind of intelligent use of what is ‘seen’. In order to make sense of these images various kinds of knowledge are neces作者: Misgiving 時(shí)間: 2025-3-23 12:29
Simon Petitjean,Denys Duchier,Yannick Parmentierstantiated) rule by its user, the system will look in its Knowledge Base for possible explanations of this rule, and ask the user to validate them. The set of explanations validated by the user is then used as a set of (almost) sufficient conditions for the application of the instantiated rule.作者: GUMP 時(shí)間: 2025-3-23 17:17 作者: duplicate 時(shí)間: 2025-3-23 18:50
Mathieu Vidalepresentational problems. This book gives an easy-to-understand insight into a new field with its problems and the solutions it offers. Thus it will be of good use to both experts and newcomers to the subject.978-3-540-50768-0978-3-540-46081-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: OVER 時(shí)間: 2025-3-23 23:43 作者: 殺子女者 時(shí)間: 2025-3-24 02:27 作者: 博識 時(shí)間: 2025-3-24 08:21
Alda Marind the representation prob- lems that it generates), the revision of beliefs (and its rules of inference), and knowledge representation (and the logical problem978-94-010-6736-2978-94-009-0553-5Series ISSN 0924-0780 作者: 鴕鳥 時(shí)間: 2025-3-24 11:58
Laurent Méhats,Lutz Stra?burgernd the representation prob- lems that it generates), the revision of beliefs (and its rules of inference), and knowledge representation (and the logical problem978-94-010-6736-2978-94-009-0553-5Series ISSN 0924-0780 作者: strdulate 時(shí)間: 2025-3-24 15:35 作者: depreciate 時(shí)間: 2025-3-24 21:00 作者: Minutes 時(shí)間: 2025-3-25 00:49 作者: 兩種語言 時(shí)間: 2025-3-25 07:00 作者: ECG769 時(shí)間: 2025-3-25 09:26 作者: 厭食癥 時(shí)間: 2025-3-25 14:55 作者: initiate 時(shí)間: 2025-3-25 15:58 作者: Bureaucracy 時(shí)間: 2025-3-25 21:12
Maxime Amblard,Philippe de Groote,Christian RetoréIncludes supplementary material: 作者: 同來核對 時(shí)間: 2025-3-26 02:30 作者: instructive 時(shí)間: 2025-3-26 07:23
978-3-662-53825-8Springer-Verlag GmbH Germany 2016作者: Integrate 時(shí)間: 2025-3-26 10:03
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)978-3-662-53826-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: BUCK 時(shí)間: 2025-3-26 13:47
https://doi.org/10.1007/978-3-662-53826-5context-free languages; formal semantics; lexical semantics; logic programming; natural language process作者: Psychogenic 時(shí)間: 2025-3-26 18:38 作者: 領(lǐng)先 時(shí)間: 2025-3-26 22:20
Actuality Entailments: When the Modality is in the Presupposition,deontic and opportunity modals, the actuality entailments disappear. We also predict that the entailment disappears with prospectivity. Finally, we argue that modal sentences giving rise to actuality entailments are informative, insofar as the contribution of the modality survives as a presupposition that the modal base is non-homogeneous.作者: synovium 時(shí)間: 2025-3-27 01:49
Language Games,n which a player ‘defeats himself’ by going inconsistent, and to introduce a simple yet revealing way of talking about unawareness. We then demonstrate how we can use ideas from epistemic game theory to define various solution concepts and justify rationality assumptions underlying a conversation.作者: Hangar 時(shí)間: 2025-3-27 07:40
A Compositional Distributional Inclusion Hypothesis,tor, and propose a measure for evaluating entailment at the phrase/sentence level. We perform experiments on four entailment datasets, showing that intersective composition in conjunction with our proposed measure achieves the highest performance.作者: nitric-oxide 時(shí)間: 2025-3-27 13:25 作者: cogitate 時(shí)間: 2025-3-27 15:25 作者: 容易懂得 時(shí)間: 2025-3-27 19:25
: Describing Description Languages,t several levels of linguistic description (e.g. syntax, morphology) within a single description language. . aims to offer means for users to easily define description languages that fit as much as possible the linguistic intuition.作者: Engaging 時(shí)間: 2025-3-28 00:59 作者: Inordinate 時(shí)間: 2025-3-28 04:46
Conference proceedings 2016niversary of the International Conference on Logical.Aspects of Computational Linguistics, LACL 2016, held in LORIA Nancy,.France, in December 2016. The 19 contributed papers, presented.together with 4 invited papers and 6 abstracts, were carefully.reviewed and selected from 38 submissions. The focu作者: Repetitions 時(shí)間: 2025-3-28 08:25 作者: 凈禮 時(shí)間: 2025-3-28 14:22
Minimalist Grammar Transition-Based Parsing,arser are very similar to the transitions of bottom-up shift-reduce parsers for Context-Free Grammars, with additional transitions for online reordering of words during parsing in order to make non-projective derivations projective.作者: 放肆的我 時(shí)間: 2025-3-28 17:09
,A Compositional Semantics for ‘If Then’ Conditionals,nally, a detailed examination of the sentences presented in the literature opposing this schema of reasoning shows that these counterexamples do not generally concern . conditionals but, rather, . conditionals and that contraposition is therefore a valid means of reasoning with regard to . conditionals in natural language, as this system predicts.作者: 萬靈丹 時(shí)間: 2025-3-28 21:58 作者: 動(dòng)物 時(shí)間: 2025-3-28 23:34 作者: 衰弱的心 時(shí)間: 2025-3-29 06:41
Categorial Dependency Grammars with Iterated Sequences,s defined here that introduces a new construction for repeatable sequences of one or several dependency names. The learnability properties of the extended CDG when grammars are infered from a dependency treebank is also studied. It leads to the definition of new classes of grammars that are learnable in the limit from dependency structures.作者: 某人 時(shí)間: 2025-3-29 07:40
On Classical Nonassociative Lambek Calculus,f [.] is enriched with algebras and phase spaces for CNL. We prove that CNL is a strongly conservative extension of NL, CNL has the strong finite model property, the grammars based on CNL (also with assumptions) generate the context-free languages, and the finitary consequence relation for CNL is decidable in polynomial time.作者: 修飾 時(shí)間: 2025-3-29 14:33
Compositional Event Semantics in Pregroup Grammars,les following a concatenation of two expressions and the associated type contraction; and the correspondence between pregroup orderings and the change of the available event variables associated to a lexical item, which the meaning predicates take scope over.作者: Invigorate 時(shí)間: 2025-3-29 15:32 作者: Aesthete 時(shí)間: 2025-3-29 22:26
0302-9743 tes the refereed proceedings of.the 20th anniversary of the International Conference on Logical.Aspects of Computational Linguistics, LACL 2016, held in LORIA Nancy,.France, in December 2016. The 19 contributed papers, presented.together with 4 invited papers and 6 abstracts, were carefully.reviewed作者: 鉤針織物 時(shí)間: 2025-3-30 02:21
Language Games, a model allows one to reason about the structure and complexity of various kinds of winning goals that conversationalists might have. We show how to use tools from topology, set-theory and logic to express such goals. Our contribution in this paper is to offer a detailed examination of an example i作者: 和平主義者 時(shí)間: 2025-3-30 07:27 作者: 絕緣 時(shí)間: 2025-3-30 11:18
Categorial Dependency Grammars with Iterated Sequences,rs (CDG) do not allow this construction because iterative dependency types only introduce the iterations of the same dependency. An extension of CDG is defined here that introduces a new construction for repeatable sequences of one or several dependency names. The learnability properties of the exte作者: 慟哭 時(shí)間: 2025-3-30 13:26 作者: 主動(dòng) 時(shí)間: 2025-3-30 18:06 作者: PSA-velocity 時(shí)間: 2025-3-31 00:29
Proof Assistants for Natural Language Semantics, that these provide useful platforms for NL semantics and reasoning on the one hand, and allow experiments to be performed on various frameworks and new theories, on the other. In particular, we show how to use Coq, a prominent type theory based proof assistant, to encode type theoretical semantics 作者: 臭了生氣 時(shí)間: 2025-3-31 01:34 作者: itinerary 時(shí)間: 2025-3-31 08:56
A Compositional Distributional Inclusion Hypothesis,l of meaning. In this paper, we extend this hypothesis to the realm of compositional distributional semantics, where meanings of phrases and sentences are computed by composing their word vectors. We present a theoretical analysis for how feature inclusion is interpreted under each composition opera作者: 不舒服 時(shí)間: 2025-3-31 12:18
Type Reconstruction for ,-DRT Applied to Pronoun Resolution,ith the aim of type-checking natural language texts in the same vein as is familiar from type-checking programs, we propose . .-DRT with automatic type reconstruction. We show a principal types theorem for .-DRT and how type reconstruction can be used to make pronoun resolution type-correct, i.e. th作者: precede 時(shí)間: 2025-3-31 14:22 作者: Endoscope 時(shí)間: 2025-3-31 20:14 作者: 搜尋 時(shí)間: 2025-3-31 22:12
On the Logic of Expansion in Natural Language,ion logic. Newly, we give Curry-Howard labelling for the iteration modality, in terms of lists, and we prove soundness and completeness of displacement calculus with additives and this modality, for phase semantics. This result has as a corollary semantic Cut-elimination. We review linguistic applic作者: CANDY 時(shí)間: 2025-4-1 02:48 作者: 爭吵 時(shí)間: 2025-4-1 09:52
: Describing Description Languages,pilers), . reuses the main concepts underlying XMG, namely . and ., to generate . XMG-like compilers by assembling elementary units called .. This brick-based definition of compilers permits users to design description languages in a highly flexible way. In particular, it makes it possible to suppor作者: 和音 時(shí)間: 2025-4-1 13:40 作者: humectant 時(shí)間: 2025-4-1 17:31 作者: 觀察 時(shí)間: 2025-4-1 19:35
Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus,ombines languages and relations via closure operators which are based on automaton transitions. We establish the strong completeness of this semantics for the full Lambek calculus via an isomorphism theorem for the syntactic concepts lattice of a language and a construction for the universal automat作者: Esalate 時(shí)間: 2025-4-1 23:34
Sanskrit literature but also turned to the material remains of Indian civilization to study the subcontinent’s history, mythology, and religion. If monuments had been arousing curiosity since the sixteenth century, the growth of British rule entailed a more systematic investigation of archaeological
