Sciweavers

1300 search results - page 111 / 260
» Probabilistic logic with independence
Sort
View
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 9 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
14 years 3 months ago
Modeling UCS as a mixture of experts
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...
Narayanan Unny Edakunni, Tim Kovacs, Gavin Brown, ...
ICDM
2006
IEEE
116views Data Mining» more  ICDM 2006»
14 years 2 months ago
Entity Resolution with Markov Logic
Entity resolution is the problem of determining which records in a database refer to the same entities, and is a crucial and expensive step in the data mining process. Interest in...
Parag Singla, Pedro Domingos
ICML
2005
IEEE
14 years 9 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
CVPR
2012
IEEE
11 years 11 months ago
A grammar for hierarchical object descriptions in logic programs
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
Toufiq Parag, Claus Bahlmann, Vinay D. Shet, Manee...