18 search results - page 3 / 4 » Finding Most Probable Worlds of Probabilistic Logic Programs |
PODS
2007
ACM
14 years 7 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
VRCAI
2004
ACM
14 years 1 months ago
2004
ACM
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...