3481 search results - page 251 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
121
click to vote
TLDI
2009
ACM
16 years 28 days ago
2009
ACM
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
122
click to vote
IJCAI
2007
15 years 5 months ago
2007
We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belo...
217
Voted
POPL
2002
ACM
16 years 4 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
256
click to vote
ICFP
2009
ACM
16 years 4 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-...
128
Voted
VTS
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...