110 search results - page 20 / 22 » ProbLog2: Probabilistic Logic Programming |
106
click to vote
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
109
click to vote
TCC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
105
Voted
CORR
2007
Springer
15 years 7 days ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
93
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
121
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...