590 search results - page 1 / 118 » Non-Failure Analysis for Logic Programs |
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
POPL
1999
ACM
13 years 9 months ago
1999
ACM
hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
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...
CL
2000
Springer
13 years 9 months ago
2000
Springer
Logic programming rules are provided to capture the rules governing formal poetry in Spanish. The resulting logic program scans verses in Spanish to provide their metric analysis. ...