4573 search results - page 263 / 915 » Automated Reasoning |
164
click to vote
LPAR
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the λClam proof ...
140
click to vote
ILP
1998
Springer
15 years 11 months ago
1998
Springer
Cohen's [1] refinement rules provide a flexible mechanism for introducing intentional background knowledge in an ILP system. Whereas Cohen used a limited second order theorem ...
138
Voted
LACL
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we try to put a bridge in between Categorial Grammar and Minimalist Grammars as they result from works which follow the Chomskyan enterprise (cf Stabler ([9]), Corne...
181
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coe...
195
click to vote
LICS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...