Sciweavers

61 search results - page 7 / 13
» On Resolution Proofs for Combinational Equivalence
Sort
View
WWW
2011
ACM
14 years 6 months ago
A self-training approach for resolving object coreference on the semantic web
An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify “equivalent” URIs that denote the ...
Wei Hu, Jianfeng Chen, Yuzhong Qu
83
Voted
CLEF
2006
Springer
15 years 3 months ago
Using Syntactic Knowledge for QA
We describe the system of the University of Groningen for the monolingual Dutch and multilingual English to Dutch QA tasks. First, we give a brief outline of the architecture of ou...
Gosse Bouma, Ismail Fahmi, Jori Mur, Gertjan van N...
115
Voted
FROCOS
2005
Springer
15 years 5 months ago
Connecting a Logical Framework to a First-Order Logic Prover
We present one way of combining a logical framework and first-order logic. The logical framework is used as an interface to a first-order theorem prover. Its main purpose is to k...
Andreas Abel, Thierry Coquand, Ulf Norell
TREC
2000
15 years 1 months ago
TREC-9 CLIR at CUHK: Disambiguation by Similarity Values Between Adjacent Words
We investigated the dictionary-based query translation method combining the translation disambiguation process using statistic cooccurrence information trained from the provided c...
Honglan Jin, Kam-Fai Wong
JFP
2000
163views more  JFP 2000»
14 years 11 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini