Sciweavers

29 search results - page 3 / 6
» Weighted versus Probabilistic Logics
Sort
View
91
Voted
JASIS
2000
120views more  JASIS 2000»
14 years 10 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
75
Voted
TVLSI
2008
110views more  TVLSI 2008»
14 years 10 months ago
Thermal Switching Error Versus Delay Tradeoffs in Clocked QCA Circuits
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
Sanjukta Bhanja, Sudeep Sarkar
108
Voted
ATAL
2009
Springer
15 years 4 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
90
Voted
IJCAI
2007
14 years 11 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
100
Voted
AAAI
2006
14 years 11 months ago
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
Hoifung Poon, Pedro Domingos