Sciweavers

725 search results - page 52 / 145
» Complexity of Computing with Extended Propositional Logic Pr...
Sort
View
LPNMR
2005
Springer
15 years 11 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
LICS
1999
IEEE
15 years 10 months ago
Some Decision Problems of Enormous Complexity
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...
Harvey Friedman
AUIC
2000
IEEE
15 years 10 months ago
Programming without a Computer: A New Interface for Children under Eight
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
Peta Wyeth, Helen C. Purchase
WWW
2004
ACM
16 years 6 months ago
Edgecomputing: extending enterprise applications to the edge of the internet
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...
Andy Davis, Jay Parikh, William E. Weihl
ICLP
2005
Springer
15 years 11 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
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...
Emad Saad, Enrico Pontelli