C. Mellish, “Abstract interpretation of Prolog programs,” In: S. Abramsky and C. Hankin, Ed., Abstract interp- retation of declarative languages, Ellis Horwood Ltd., pp. 181–198, 1987.
has been cited by the following article:
TITLE: Incremental Computation of Success Patterns of Logic Programs
AUTHORS: Lunjin Lu
KEYWORDS: Incremental Analysis, Success Patterns, Abstract Interpretation, Depth Abstract, Stump Abstraction, Logic Programs
JOURNAL NAME: Journal of Software Engineering and Applications, Vol.3 No.3, April 8, 2010
ABSTRACT: A method is presented for incrementally computing success patterns of logic programs. The set of success patterns of a logic program with respect to an abstraction is formulated as the success set of an equational logic program modulo an equality theory that is induced by the abstraction. The method is exemplified via depth and stump abstractions. Also presented are algorithms for computing most general unifiers modulo equality theories induced by depth and stump abstractions.