725 search results - page 52 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
103
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
106
Voted
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
118
Voted
AUIC
2000
IEEE
15 years 7 months ago
2000
IEEE
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
136
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
Content delivery networks have evolved beyond traditional distributed caching. With services such as Akamai's EdgeComputing it is now possible to deploy and run enterprise bu...
157
Voted
ICLP
2005
Springer
15 years 8 months ago
2005
Springer
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...