𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Expressibility and the problem of efficient text planning

✍ Scribed by John A. Bateman

Publisher
Springer
Year
1996
Tongue
English
Weight
598 KB
Volume
11
Category
Article
ISSN
0922-6567

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Pseudocharacters and the Problem of Expr
Pseudocharacters and the Problem of Expressibility for Some Groups
✍ ValeriΔ­ A. FaΔ­ziev; Prasanna K. Sahoo πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 247 KB

For a class of extensions of free products of groups, a description is given of the space of the real-valued functions Ο• defined on the group G and satisfying the conditions (1) the set Ο• xy -Ο• x -Ο• y x y ∈ G is bounded; and (2) Ο• x n = nΟ• x for any x ∈ G and any n ∈ (the set of integers). Let G be

Monotonicity and the Expressibility of N
Monotonicity and the Expressibility of NP Operators
✍ Iain A. Stewart πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 517 KB

## Abstract We investigate why similar extensions of first‐order logic using operators (that is, generalized quantifiers) corresponding to NP‐complete decision problems apparently differ in expressibility: the logics capture either NP or L^NP^. It had been conjectured that the complexity class capt

On the expressibility and the computabil
On the expressibility and the computability of untyped queries
✍ Jose Maria Turull Torres πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 202 KB

The work of Chandra and Harel contained in Chandra and Harel (J. Comput. System Sci. 21 (1980) 156 -178) can be considered as the beginning of the construction of a theoretical framework in which the computability and the complexity of queries to relational databases could be studied. In the deΓΏniti