23 search results - page 3 / 5 » A Tractable First-Order Probabilistic Logic |
AAAI
2008
14 years 11 months ago
2008
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
NAACL
2007
14 years 11 months ago
2007
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...
86
Voted
CSL
2009
Springer
15 years 1 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
UAI
2008
14 years 11 months ago
2008
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...
97
Voted
FOIS
2006
14 years 11 months ago
2006
Abstract. Across a wide range of domains, there is an urgent need for a wellfounded approach to incorporating uncertain and incomplete knowledge into formal domain ontologies. Alth...