Worst-Case Groundness Analysis Using Definite Boolean Functions

Simple item page
dc.creatorGenaim, Samir
dc.creatorCodish, Michael
dc.creatorHowe, Jacob M.
dc.date2004-05-27
dc.date.accessioned2026-07-07T03:21:22Z
dc.date.available2026-07-07T03:21:22Z
dc.descriptionThis 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.
dc.descriptionAppeared in Theory and Practice of Logic Programming, vol. 1, no. 5, 2001
dc.identifierhttps://arxiv.org/abs/cs/0405101
dc.identifierhttp://arxiv.org/abs/cs/0405101
dc.identifierTheory and Practice of Logic Programming, vol. 1, no. 5, 2001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32169
dc.subjectProgramming Languages
dc.subjectD.1.6; D.3.2
dc.titleWorst-Case Groundness Analysis Using Definite Boolean Functions
dc.typetext

Files

Collections

arXiv