4192 search results - page 373 / 839 » Probabilistic Logic Programming |
164
Voted
JAR
2002
15 years 5 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
263
click to vote
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
159
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
148
click to vote
SOCO
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
162
click to vote
CLIMA
2007
15 years 7 months ago
2007
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...