150 search results - page 6 / 30 » Dynamically Ordered Probabilistic Choice Logic Programming |
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
PE
2000
Springer
13 years 7 months ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
PADL
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
AIPS
2007
13 years 9 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...