Thumbnail
Access Restriction
Open

Author Howe, Jacob M. ♦ King, Andy
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Pos-based Groundness Analyser ♦ Boolean Function ♦ Complex Operation ♦ Benchmark Suite ♦ Multiheaded Clause Representation ♦ Stratified Algorithm ♦ Positive Boolean Function ♦ Propositional Horn Clause ♦ Logic Program ♦ Domain Operation ♦ Multiheaded Clause
Description Boolean functions are ubiquitous in the analysis of (constraint) logic programs. The domain of positive Boolean functions, Pos, has been used for expressing, for example, groundness, finiteness and sharing dependencies. The performance of an analyser based on Boolean functions is critically dependent on the way in which the functions are represented. This paper discusses multiheaded clauses as a representation of positive Boolean functions. The domain operations for multiheaded clauses are conceptually simple and can be implemented straightforwardly in Prolog. Moreover these operations generalise those for the less algorithmically complex operations of propositional Horn clauses, leading to naturally stratified algorithms. The multiheaded clause representation is used to build a Pos-based groundness analyser. The analyser performs surprisingly well and scales smoothly, not requiring widening to analyse any program in the benchmark suite.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2001-01-01
Publisher Institution In P Codognet, editor, International Conference on Logic Programming, volume 2237 of LNCS