Analysis of Normal Logic Programs

@inproceedings{Fages1998AnalysisON,
  title={Analysis of Normal Logic Programs},
  author={François Fages and Roberta Gori},
  booktitle={SAS},
  year={1998}
}
In this paper we present a dataflow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation. 

References

SHOWING 1-10 OF 43 REFERENCES
A Hierarchy of Semantics for Normal Constraint Logic Programs
The different properties characterizing the operational behavior of logic programs can be organized in a hierarchy of fixpoint semantics related by Galois insertions, having the least Herbrand model
Negation in Logic Programming
  • K. Kunen
  • Computer Science
    J. Log. Program.
  • 1987
Enumeration of Success Patterns in Logic Programs
Signed Data Dependencies in Logic Programs
  • K. Kunen
  • Computer Science
    J. Log. Program.
  • 1989
Constructive Negation by Pruning
  • F. Fages
  • Computer Science
    J. Log. Program.
  • 1997
Negation and Constraint Logic Programming
TLDR
This paper describes a framework for constructive negation for constraint logic programming over arbitrary structures which is sound and complete with respect to the three-valued consequences of the completion of a program.
"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics
TLDR
A definition of a hierarchy of collecting semantics, including well known semantics for logic programs, and a constructive characterization for the “best” collecting semantics for analysis are presented.
...
...