275 search results - page 3 / 55 » Non-Termination Inference of Logic Programs |
105
click to vote
SAS
2001
Springer
15 years 4 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...
109
click to vote
ENTCS
2006
14 years 11 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...
82
Voted
ESOP
2003
Springer
15 years 4 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...
SAS
2004
Springer
15 years 4 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
124
click to vote
ECSQARU
2005
Springer
15 years 5 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...