492 search results - page 15 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
PLILP
1998
Springer
15 years 2 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
LPNMR
2005
Springer
15 years 4 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
AMC
2005
14 years 10 months ago
2005
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...