20 search results - page 4 / 4 » Boolean Grammars |
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
BIRTHDAY
2009
Springer
14 years 3 days ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
LREC
2010
13 years 6 months ago
2010
The paper presents Bulgarian National Corpus project (BulNC) - a large-scale, representative, online available corpus of Bulgarian. The BulNC is also a monolingual general corpus,...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...