Sciweavers

1242 search results - page 19 / 249
» The Theory of Grammar Constraints
Sort
View
CIE
2007
Springer
15 years 5 months ago
Multi-valued Logics, Effectiveness and Domains
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...
Giangiacomo Gerla
141
Voted
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 6 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
132
Voted
ACL
2010
14 years 12 months ago
Hard Constraints for Grammatical Function Labelling
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
Wolfgang Seeker, Ines Rehbein, Jonas Kuhn, Josef v...
SAS
1999
Springer
15 years 6 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
96
Voted
BIRTHDAY
2009
Springer
15 years 8 months ago
Formal Grammars of Early Language
We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. T...
Shuly Wintner, Alon Lavie, Brian MacWhinney