Sciweavers

1204 search results - page 156 / 241
» Hybrid Probabilistic Programs
Sort
View
101
Voted
ESOP
2005
Springer
15 years 6 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
111
Voted
JSAI
2005
Springer
15 years 6 months ago
Learning Stochastic Logical Automaton
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
Hiroaki Watanabe, Stephen Muggleton
109
Voted
APWEB
2006
Springer
15 years 4 months ago
Providing an Uncertainty Reasoning Service for Semantic Web Application
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
Lei Li, Qiaoling Liu, Yunfeng Tao, Lei Zhang, Jian...
129
Voted
CSR
2011
Springer
14 years 4 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
129
Voted
ENTCS
2007
87views more  ENTCS 2007»
15 years 1 months ago
A Study on the Practicality of Poly-Controlled Partial Evaluation
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global co...
Claudio Ochoa, Germán Puebla