4192 search results - page 507 / 839 » Probabilistic Logic Programming |
144
Voted
SIGSOFT
2002
ACM
16 years 5 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
144
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
165
click to vote
INFORMS
1998
15 years 4 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
169
click to vote
LOPSTR
2007
Springer
15 years 10 months ago
2007
Springer
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
160
click to vote
CADE
1990
Springer
15 years 8 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...