125 search results - page 2 / 25 » Transforming Normal Programs by Replacement |
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
ASP
2003
Springer
14 years 18 days 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...
PASTE
1999
ACM
13 years 11 months ago
1999
ACM
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
CC
2003
Springer
14 years 18 days ago
2003
Springer
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...