Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
This paper develops the Church-Rosser theorem for the rewriting system CCLβ on type-free categorial combinators introduced by Curien. The system CCLβ is not confluent. However we show that there are various sets D of categorical combinator terms such that each D satisfies the following two conditions: (1) D is closed under reduction by CCLβ; (2) CCLβ is confluent on D. Moreover we examine the relation among these sets. © 1989.
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science