213 search results - page 23 / 43 » Automated Termination Analysis for Logic Programs with Cut |
FLOPS
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...
109
click to vote
LOPSTR
2007
Springer
15 years 7 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
156
click to vote
USS
2010
14 years 11 months ago
2010
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
193
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
151
click to vote
CL
1999
Springer
15 years 1 months ago
1999
Springer
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...