4555 search results - page 123 / 911 » Deductive Algorithmic Knowledge |
ATAL
2005
Springer
14 years 4 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...
AGI
2008
14 years 6 days 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...
IJCAI
2001
14 years 4 days 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...
PPDP
2010
Springer
13 years 9 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...
JMLR
2010
13 years 5 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, ...