Sciweavers

2835 search results - page 468 / 567
» Automatic Question Answering
Sort
View
JSYML
2007
100views more  JSYML 2007»
15 years 6 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
SPEECH
2002
112views more  SPEECH 2002»
15 years 6 months ago
Relating dialogue games to information state
This paper1 discusses the use of `conversational' or `dialogue games' as a basis for building dialogue systems. We give a tutorial overview of some recent attempts to re...
Stephen G. Pulman
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 5 months ago
Liquidity in Credit Networks: A Little Trust Goes a Long Way
Credit networks represent a way of modeling trust between entities in a network. Nodes in the network print their own currency and trust each other for a certain amount of each ot...
Pranav Dandekar, Ashish Goel, Ramesh Govindan, Ian...
ESWS
2010
Springer
15 years 5 months ago
The Semantic Gap of Formalized Meaning
Recent work in Ontology learning and Text mining has mainly focused on engineering methods to solve practical problem. In this thesis, we investigate methods that can substantially...
Sebastian Hellmann
LOGCOM
2010
158views more  LOGCOM 2010»
15 years 4 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra