4192 search results - page 75 / 839 » Probabilistic Logic Programming |
CL
2000
Springer
14 years 2 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
ENTCS
2006
13 years 10 months ago
2006
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...
COCO
1998
Springer
14 years 2 months ago
1998
Springer
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is NP-complete. If the error is very small, however (more precisely, if the erro...
IFIP
2009
Springer
14 years 4 months ago
2009
Springer
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
