3470 search results - page 162 / 694 » Head-Elementary-Set-Free Logic Programs |
166
click to vote
JLP
2007
15 years 6 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
198
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
163
click to vote
ENTCS
2007
15 years 6 months ago
2007
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
140
click to vote
JELIA
1990
Springer
15 years 10 months ago
1990
Springer
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
151
click to vote
ENTCS
2007
15 years 6 months ago
2007
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...