Titlebook: Logical Aspects of Computational Linguistics; Third International Michael Moortgat Conference proceedings 2001 Springer-Verlag Berlin Heid

Interjection

書(shū)目名稱Logical Aspects of Computational Linguistics影響因子(影響力)




書(shū)目名稱Logical Aspects of Computational Linguistics影響因子(影響力)學(xué)科排名




書(shū)目名稱Logical Aspects of Computational Linguistics網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Logical Aspects of Computational Linguistics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Logical Aspects of Computational Linguistics被引頻次




書(shū)目名稱Logical Aspects of Computational Linguistics被引頻次學(xué)科排名




書(shū)目名稱Logical Aspects of Computational Linguistics年度引用




書(shū)目名稱Logical Aspects of Computational Linguistics年度引用學(xué)科排名




書(shū)目名稱Logical Aspects of Computational Linguistics讀者反饋




書(shū)目名稱Logical Aspects of Computational Linguistics讀者反饋學(xué)科排名

車床

Pigeon

Hypothetical Reasoning and Basic Non-Constituent Coordination in Yype-Logical Grammarment to lexical conjunctions, and hypothetical reasoning in Categorial Logics. A way of extending the logic is suggested, so that coordination can be applied to types depending on undischarged assumptions. By a certain “resource manipulation” of assumptions (of hypothetical reasoning), a late-discha

CRANK

Computational and Structural Aspects of Openly Specified Type Hierarchiesifies properties of the hierarchy, without providing a complete description. Open specification provides increased expressive power, but at the expense of considera- ble computational complexity, with essential tasks being NP-complete or NP-hard. In this work, a formal study of the structural and co

易改變

capsaicin

An LTAG Perspective on Categorial Inferencem and therefore deals with structural, not string, adjacency. When looked at from the logic perspective, the nodes of the trees become types as in a categorial grammar, with corresponding deductive connections between parent and daughter nodes. The resulting system is based on a hybrid logic, with o

Ornithologist

Dominance Constraints: Algorithms and Complexityrse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their first-order theory. The main result of this paper is that the satisfiability problem of dominance constraints is NP-complete. We present two NP algorithms for solving dominance constraints, wh

半球

ORE

Sequential Construction of Logical Formsand Quantification in, amongst others, the papers [.],[.], [.],[.],[.]. In this model, a natural language string consists of a sequence of ‘instructions packages’ to construct some term in a formal representation language, the . of the string in question. Parsing, then, is the process of executing t

縱火

Derivational Minimalism Is Mildly Context–Sensitive well. We show that this type of a minimalist grammar (MG) constitutes a subclass of mildly context–sensitive grammars in the sense that for each MG there is a weakly equivalent linear context–free rewriting system (LCFRS). Moreover, an infinite hierarchy of MGs is established in relation to a hiera