Sciweavers

2496 search results - page 168 / 500
» Error-detecting properties of languages
Sort
View
TCS
2008
15 years 4 months ago
On the weight of universal insertion grammars
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
Lila Kari, Petr Sosík
COGSCI
2004
82views more  COGSCI 2004»
15 years 4 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
CL
2000
Springer
15 years 4 months ago
Semantics of well-moded input-consuming logic programs
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
TOSEM
2002
93views more  TOSEM 2002»
15 years 4 months ago
Alloy: a lightweight object modelling notation
Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a set-based formula syntax powerful en...
Daniel Jackson
ACL
2010
15 years 2 months ago
Complexity Assumptions in Ontology Verbalisation
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
Richard Power