Sciweavers

2440 search results - page 175 / 488
» Data-Intensive Question Answering
Sort
View
125
Voted
CSR
2009
Springer
15 years 7 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
WCE
2007
15 years 5 months ago
Ethics Review: Practical Suggestions for Enabling Inclusive Computer Science Research
—People make and use tools. Many information technology tools, applying computer science research, powerfully influence human behaviour. Some questions about human behaviour can ...
Robert H. Barbour
MST
2006
100views more  MST 2006»
15 years 4 months ago
On Delivery Times in Packet Networks under Adversarial Traffic
We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...
Adi Rosén, Michael S. Tsirkin
CADE
2008
Springer
16 years 4 months ago
Combining Theorem Proving with Natural Language Processing
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
Björn Pelzer, Ingo Glöckner
CADE
2003
Springer
16 years 4 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...