44 search results - page 4 / 9 » Approximate Entailment |
RTA
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
116
click to vote
IAT
2006
IEEE
15 years 7 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
ACL
1996
15 years 3 months ago
1996
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...
IJCAI
1989
15 years 2 months ago
1989
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
100
click to vote
TIT
2008
15 years 1 months ago
2008
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...