579 search results - page 50 / 116 » Combined reasoning by automated cooperation |
CCL
1994
Springer
14 years 25 days ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
CSL
2004
Springer
14 years 14 days ago
2004
Springer
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
EWCBR
2006
Springer
14 years 11 days ago
2006
Springer
Abstract. We present a CBR approach to musical playlist recommendation. A good playlist is not merely a bunch of songs, but a selected collection of songs, arranged in a meaningful...
LACL
1998
Springer
14 years 9 days ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
TPHOL
1995
IEEE
14 years 7 days ago
1995
IEEE
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...