590 search results - page 3 / 118 » Non-Failure Analysis for Logic Programs |
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
ECSQARU
2005
Springer
14 years 1 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...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
SAS
2001
Springer
13 years 12 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...