3385 search results - page 375 / 677 » Language, Logic, and the Brain |
251
click to vote
POPL
2001
ACM
16 years 7 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
191
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
163
click to vote
ICTAC
2007
Springer
16 years 29 days ago
2007
Springer
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
188
click to vote
LACL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
185
click to vote
BIRTHDAY
1992
Springer
15 years 11 months ago
1992
Springer
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...