52 search results - page 2 / 11 » Reexecution-Based Analysis of Logic Programs with Delay Decl... |
ASP
2003
Springer
13 years 10 months ago
2003
Springer
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. This is not quite so. This paper shows an...
PPDP
2007
Springer
13 years 11 months ago
2007
Springer
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
AMAST
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
LOPSTR
2004
Springer
13 years 10 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
SAS
2005
Springer
13 years 10 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...