3440 search results - page 496 / 688 » Logics For Context-Free Languages |
155
click to vote
ACTAC
2002
15 years 7 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
207
click to vote
APIN
2002
15 years 7 months ago
2002
We develop the scheme of indefinite constraint databases using first-order logic as our representation language. When this scheme is instantiated with temporal constraints, the res...
190
click to vote
AROBOTS
1998
15 years 6 months ago
1998
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
198
click to vote
ICTIR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A mismatch between differenteventspaceshasbeen used toargue against rank equivalence of classic probabilistic models of information retrieval and language models. We ques...
190
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...