4555 search results - page 123 / 911 » Deductive Algorithmic Knowledge |
100
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
This publication summarizes research on the the design and implementation of liberalized version of existing truth-finding protocols for argumentation, such as the standard two-a...
107
click to vote
AGI
2008
15 years 2 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
111
click to vote
IJCAI
2001
15 years 1 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
113
Voted
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
105
Voted
JMLR
2010
14 years 7 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...