3691 search results - page 223 / 739 » Bayesian Logic Programs |
312
Voted
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
166
click to vote
TASE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
277
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
157
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
167
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...