Sciweavers

1953 search results - page 19 / 391
» Embedded Probabilistic Programming
Sort
View
LPNMR
2001
Springer
15 years 2 months ago
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
Thomas Lukasiewicz
ICFP
2008
ACM
15 years 9 months ago
Experience report: playing the DSL card
This paper describes our experience using a functional language, Haskell, to build an embedded, domain-specific language (DSL) for component configuration in large-scale, real-tim...
Mark P. Jones
COCO
1998
Springer
86views Algorithms» more  COCO 1998»
15 years 1 months ago
The Satisfiability Problem for Probabilistic Ordered Branching Programs
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...
Manindra Agrawal, Thomas Thierauf
69
Voted
ICALP
2003
Springer
15 years 2 months ago
A Testing Scenario for Probabilistic Automata
Mariëlle Stoelinga, Frits W. Vaandrager