797 search results - page 73 / 160 » Eliminating Proofs from Programs |
137
click to vote
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
150
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
108
click to vote
NMR
2004
Springer
15 years 6 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
106
Voted
JAR
2006
15 years 19 days ago
2006
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...
100
click to vote
SAS
2004
Springer
15 years 6 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...