4192 search results - page 518 / 839 » Probabilistic Logic Programming |
147
click to vote
CF
2005
ACM
15 years 6 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
228
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
151
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
123
click to vote
GPCE
2009
Springer
15 years 9 months ago
2009
Springer
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
158
click to vote
AOSD
2007
ACM
15 years 8 months ago
2007
ACM
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...