279 search results - page 2 / 56 » Determinacy Inference for Logic Programs |
CCIA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
ENTCS
2006
13 years 4 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
ESOP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial poi...