Transforming floundering into success. Issue 2 (30th October 2012)

• Record Type: Journal Article
• Authors: NAISH, LEE
• Is Part Of: Theory and practice of logic programming. Volume 14:Issue 2(2014)
• Page Start: 215
• Page End: 238
• Publication Date: 2012-10-30
• Subjects: floundering, -- delays, -- coroutining, -- program analysis, -- abstract interpretation, -- program transformation, -- declarative debugging; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S147106841200035X
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: We show how logic programs with "delays" can be transformed to programs without delays in a way that preserves information concerning floundering (also known as deadlock). This allows a declarative (model-theoretic), bottom-up or goal-independent approach to be used for analysis and debugging of properties related to floundering. We rely on some previously introduced restrictions on delay primitives and a key observation which allows properties such as groundness to be analysed by approximating the (ground) success set.