Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-8
|
Results: 8
A simple polynomial groundness analysis for logic programs
Authors:
Heaton, A Abo-Zaed, M Codish, M King, A
Citation:
A. Heaton et al., A simple polynomial groundness analysis for logic programs, J LOGIC PR, 45(1-3), 2000, pp. 143-156
Improving program analyses by structure untupling
Authors:
Codish, M Marriott, K Taboch, C
Citation:
M. Codish et al., Improving program analyses by structure untupling, J LOGIC PR, 43(3), 2000, pp. 251-263
An algebraic approach to sharing analysis of logic programs
Authors:
Codish, M Lagoon, V Bueno, F
Citation:
M. Codish et al., An algebraic approach to sharing analysis of logic programs, J LOGIC PR, 42(2), 2000, pp. 111-149
Type dependencies for logic programs using ACI-unification
Authors:
Codish, M Lagoon, V
Citation:
M. Codish et V. Lagoon, Type dependencies for logic programs using ACI-unification, THEOR COMP, 238(1-2), 2000, pp. 131-159
A semantic basis for the termination analysis of logic programs
Authors:
Codish, M Taboch, C
Citation:
M. Codish et C. Taboch, A semantic basis for the termination analysis of logic programs, J LOGIC PR, 41(1), 1999, pp. 103-123
Worst-case groundness analysis using positive Boolean functions
Authors:
Codish, M
Citation:
M. Codish, Worst-case groundness analysis using positive Boolean functions, J LOGIC PR, 41(1), 1999, pp. 125-128
Efficient goal directed bottom-up evaluation of logic programs
Authors:
Codish, M
Citation:
M. Codish, Efficient goal directed bottom-up evaluation of logic programs, J LOGIC PR, 38(3), 1999, pp. 355-370
Sharing and groundness dependencies in logic programs
Authors:
Codish, M Sondergaard, H Stuckey, PJ
Citation:
M. Codish et al., Sharing and groundness dependencies in logic programs, ACM T PROGR, 21(5), 1999, pp. 948-976
Risultati:
1-8
|