Record ID | harvard_bibliographic_metadata/ab.bib.14.20150123.full.mrc:145073520:3530 |
Source | harvard_bibliographic_metadata |
Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.14.20150123.full.mrc:145073520:3530?format=raw |
LEADER: 03530nam a22005415a 4500
001 014106236-3
005 20140808190828.0
008 140616s2014 gw | s ||0| 0|eng d
020 $a9783662437421
020 $a9783662437421
020 $a9783662437414
024 7 $a10.1007/978-3-662-43742-1$2doi
035 $a(Springer)9783662437421
040 $aSpringer
050 4 $aQ334-342
050 4 $aTJ210.2-211.495
072 7 $aUYQ$2bicssc
072 7 $aTJFM1$2bicssc
072 7 $aCOM004000$2bisacsh
082 04 $a006.3$223
100 1 $aAsher, Nicholas,$eeditor.
245 10 $aLogical Aspects of Computational Linguistics :$b8th International Conference, LACL 2014, Toulouse, France, June 18-20, 2014. Proceedings /$cedited by Nicholas Asher, Sergei Soloviev.
264 1 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bImprint: Springer,$c2014.
300 $aXVI, 189 p. 29 illus.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v8535
505 0 $aRegular Articles -- Building PMCFG Parsers as Datalog Program Transformations -- Representing Anaphora with Dependent Types -- An Interpretation of Full Lambek Calculus in Its Variant without Empty Antecedents of Sequents -- Adverbs in a Modern Type Theory -- An Algebraic Approach to Multiple Context-Free Grammars -- An ACG View on G-TAG and Its g-Derivation -- On Harmonic CCG and Pregroup Grammars -- The Granularity of Meaning in Proof-Theoretic Semantics -- Late Merge as Lowering Movement in Minimalist Grammars -- Pseudogapping as Pseudo-VP Ellipsis -- Monotonicity Reasoning in Formal Semantics Based on Modern Type Theories -- Semantically Inactive Multiplicatives and Words as Types -- Generalising Predicate and Argument Invariance.-Invited Speaker -- Formal Semantics in Modern Type Theories: Is It Model-Theoretic, Proof-Theoretic or Both?.
520 $aEdited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 8th International Conference on Logical Aspects of Computational Linguistics (LACL 2014) held in Toulouse, France, in June 2014. On the broadly syntactic side, there are papers on the logical and computational foundations of context free grammars, pregroup grammars, on the Lambek calculus and on formalizations of aspects of minimalism. There is also a paper on Abstract Categorical Grammar, as well as papers on issues at the syntax/semantics interface. On the semantic side, the volume's papers address monotonicity reasoning, and the semantics of adverbs in type theory, proof theoretical semantics and predicate and argument invariance.
650 20 $aComputational linguistics.
650 24 $aArtificial Intelligence (incl. Robotics)
650 10 $aComputer science.
650 0 $aTranslators (Computer programs)
650 0 $aComputer science.
650 0 $aLogic design.
650 0 $aArtificial intelligence.
650 0 $aComputational linguistics.
650 24 $aMathematical Logic and Formal Languages.
650 24 $aLanguage Translation and Linguistics.
650 24 $aLogics and Meanings of Programs.
650 24 $aComputer Science, general.
700 1 $aSoloviev, Sergei,$eeditor.
776 08 $iPrinted edition:$z9783662437414
830 0 $aLecture Notes in Computer Science ;$v8535.
988 $a20140702
906 $0VEN