000 | 03701nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-69631-5 | ||
003 | DE-He213 | ||
005 | 20160624102058.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1997 gw | s |||| 0|eng d | ||
020 |
_a9783540696315 _9978-3-540-69631-5 |
||
024 | 7 |
_a10.1007/BFb0052147 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aLogical Aspects of Computational Linguistics _h[electronic resource] : _bFirst International Conference, LACL '96 Nancy, France, September 23–25, 1996 Selected Papers / _cedited by Christian Retoré. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
300 |
_aX, 442 p. _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 ; _v1328 |
|
505 | 0 | _aLogical aspects of computational linguistics: An introduction -- Partial proof trees, resource sensitive logics and syntactic constraints -- Inessential features -- Linear logic as logic programming: An abstract -- Derivational minimalism -- Tree adjoining grammars in noncommutative linear logic -- Constructing different phonological bracketings from a proof net -- Vagueness and type theory -- A natural language explanation for formal proofs -- Models for polymorphic Lambek Calculus -- Sloopy Identity -- A family of decidable feature logics which support HPSG-style set and list constructions -- Language understanding: A procedural perspective -- The automatic deduction of classificatory systems from linguistic theories (abridged) -- A belief-centered treatment of pragmatic presupposition -- Connected sets of types and categorial consequence -- Generation as deduction on labelled proof nets -- Semilinearity as a syntactic invariant -- Quantitative constraint logic programming for weighted grammar applications -- Strict LT2 : Regular :: Local : Recognizable -- Pomset Logic and variants in natural languages -- Constraint logic programming for computational linguistics -- Representation theorems for residuated groupoids. | |
520 | _aThis book constitutes the strictly refereed post-conference proceedings of the First International Conference on Logical Aspects of Computational Linguistics, LACL '96, held in Nancy, France in April 1996. The volume presents 18 revised full papers carefully selected and reviewed for inclusion in the book together with four invited contributions by leading authorities and an introductory survey with a detailed bibliography. The papers cover all relevant logical aspects of computational linguistics like logical inference, grammars, logical semantics, natural language processing, formal proofs, logic programming, type theory, etc. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aRetoré, Christian. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540637004 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1328 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0052147 |
942 |
_2EBK7296 _cEBK |
||
999 |
_c36590 _d36590 |