Worst-Case Groundness Analysis Using Definite Boolean Functions

Details Worst-Case Groundness Analysis Using Definite Boolean Functions Worst-Case Groundness Analysis Using Definite Boolean Functions

2004-05-27

arxiv.org/abs/cs/0405101v1

Theory and Practice of Logic Programming, vol. 1, no. 5, 2001

Computer Science

Programming Languages

Appeared in Theory and Practice of Logic Programming, vol. 1, no. 5, 2001

Scientific paper

This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Pos) Boolean functions. For Def, an example is given for which any Def-based abstract interpretation for groundness analysis follows a chain which is exponential in the number of argument positions as well as in the number of clauses but sub-exponential in the size of the program. For Pos, we strengthen a previous result by illustrating an example for which any Pos-based abstract interpretation for groundness analysis follows a chain which is exponential in the size of the program. It remains an open problem to determine if the worst case for Def is really as bad as that for Pos.

Affiliated with

Also associated with

No associations

Rating

Worst-Case Groundness Analysis Using Definite Boolean Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Worst-Case Groundness Analysis Using Definite Boolean Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worst-Case Groundness Analysis Using Definite Boolean Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270038