590 search results - page 5 / 118 » Non-Failure Analysis for Logic Programs |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
CAV
2004
Springer
14 years 27 days ago
2004
Springer
This paper reviews the principles behind the paradigm of “abstract interpretation via § -valued logic,” discusses recent work to extend the approach, and summarizes ongoing re...
LOPSTR
2004
Springer
14 years 26 days ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
