3470 search results - page 361 / 694 » Head-Elementary-Set-Free Logic Programs |
159
click to vote
CIE
2007
Springer
16 years 26 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
178
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
172
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
154
click to vote
IGPL
2008
15 years 6 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
202
Voted
LOPSTR
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...