Sciweavers

16 search results - page 1 / 4
» Approximate inference for first-order probabilistic language...
Sort
View
89
Voted
UAI
2008
14 years 11 months ago
Sampling First Order Logical Particles
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
Hannaneh Hajishirzi, Eyal Amir
104
Voted
AAAI
2012
13 years 18 days ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb
112
Voted
AAAI
2011
13 years 10 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
89
Voted
AIPS
2007
15 years 16 days ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
121
Voted
AAAI
1996
14 years 11 months ago
Irrelevance and Conditioning in First-Order Probabilistic Logic
First-order probabilistic logic is a powerful knowledge representation language. Unfortunately, deductive reasoning based on the standard semantics for this logic does not support...
Daphne Koller, Joseph Y. Halpern