Skip to:Content
|
Bottom
Cover image for New Frontiers in Artificial Intelligence JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Kanagawa, Japan, October 27-28, 2014, Revised Selected Papers
Title:
New Frontiers in Artificial Intelligence JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Kanagawa, Japan, October 27-28, 2014, Revised Selected Papers
Author:
Murata, Tsuyoshi. editor.
ISBN:
9783662481196
Edition:
1st ed. 2015.
Physical Description:
XIII, 357 p. 48 illus. online resource.
Series:
Lecture Notes in Artificial Intelligence, 9067
Contents:
LENLS 11 -- Logic and Engineering of Natural Language Semantics (LENLS) 11 -- Codability and Robustness in Formal Natural Language Semantics -- CI via DTS -- Formal Analysis of Epistemic Modalities and Conditionals based on Logic of Belief Structures -- A type-logical account of quantification in event semantics -- Towards a Wide-Coverage Tableau Method for Natural Logic -- Resolving Modal Anaphora in Dependent Type Semantics -- Canonical Constituents and Non-canonical Coordination / Simple Categorial Grammar Account -- A good intensifier -- Strict Comparison and Weak Necessity: The Case of Epistemic Yao in Mandarin Chinese -- Computing the Semantics of Plurals and Massive Entities using Many-Sorted Types -- On CG Management of Japanese Weak Necessity Modal Hazu -- Using Signatures in Type Theory to Represent Situations -- Scope as syntactic abstraction -- Focus and Givenness Across the Grammar -- JURISIN 2014 -- Eighth International Workshop on Juris-Informatics (JURISIN 2014) -- Classification of Precedents by Modeling Tool for Action and Epistemic State: DEMO -- Legal Question Answering Using Ranking SVM and Syntactic/Semantic Similarity -- Translating Simple Legal Text to Formal Representations -- Analyzing Reliability Change in Legal Case -- GABA 2014 -- Workshop on Graph-based Algorithms for Big Data and its Applications (GABA2014) -- Anchor Alignment Problem for Rooted Labeled Trees -- Central Point Selection for Dimension Reduction ProjectionSimple-Map using Binary Quantization -- Mapping Kernels for Cyclically Ordered Trees -- Finding Ambiguous Patterns on Grammar Compressed String -- Detecting Anomalous Subgraphs on Attributed Graphs Using Graph Cuts.
Added Corporate Author:
Holds:
Copies:

Available:*

Library
Material Type
Item Barcode
Shelf Number
Status
Item Holds
Searching...
E-Book 519061-1001 XX(519061.1)
Searching...

On Order

Go to:Top of Page