Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Precise and efficient groundness analysis for logic programs

Precise and efficient groundness analysis for logic programs Precise and Efficient Groundless for Logic Programs KIM MARRIOTT Monash University and HARALD S0 NDERGAARD The University of Melbourne Analysis We show how precise groundless information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as œapproximations  to groundless dependencies between variables. This idea is not new, and different classes of Boolean functions have functions, is more suitable than been used. We argue, however, that one class, the positiue others. Positive Boolean functions have a certain property which we (inspired by A. Langen) call œcondensation.  This property allows for rapid computation of groundless information. Techniques]: Logic Programming; Categories and Subject Descriptors: D.1.6 [Programming Languages]: Processors ”compilers; optimization; F.3.1 [Logics and D.3.4. [Programming Meanings of Programs]: Specifying and Verifying and Reasoning about Programs-assertions; invariants; logics of programs General Terms: Languages, Theory interpretation, condensation, groundless analysis, Additional Key Words and Phrases: Abstract propositional logic 1. INTRODUCTION Groundless analysis is arguably the most important dataflow analysis for point, is variable x always logic programs. The question œAt a given program that contains no variables?  is not only important for an bound to a term optimizing cally The every reason compiler programming http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Letters on Programming Languages and Systems (LOPLAS) Association for Computing Machinery

Precise and efficient groundness analysis for logic programs

Loading next page...
 
/lp/association-for-computing-machinery/precise-and-efficient-groundness-analysis-for-logic-programs-N4VRSFwG0W

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1993 by ACM Inc.
ISSN
1057-4514
DOI
10.1145/176454.176519
Publisher site
See Article on Publisher Site

Abstract

Precise and Efficient Groundless for Logic Programs KIM MARRIOTT Monash University and HARALD S0 NDERGAARD The University of Melbourne Analysis We show how precise groundless information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as œapproximations  to groundless dependencies between variables. This idea is not new, and different classes of Boolean functions have functions, is more suitable than been used. We argue, however, that one class, the positiue others. Positive Boolean functions have a certain property which we (inspired by A. Langen) call œcondensation.  This property allows for rapid computation of groundless information. Techniques]: Logic Programming; Categories and Subject Descriptors: D.1.6 [Programming Languages]: Processors ”compilers; optimization; F.3.1 [Logics and D.3.4. [Programming Meanings of Programs]: Specifying and Verifying and Reasoning about Programs-assertions; invariants; logics of programs General Terms: Languages, Theory interpretation, condensation, groundless analysis, Additional Key Words and Phrases: Abstract propositional logic 1. INTRODUCTION Groundless analysis is arguably the most important dataflow analysis for point, is variable x always logic programs. The question œAt a given program that contains no variables?  is not only important for an bound to a term optimizing cally The every reason compiler programming

Journal

ACM Letters on Programming Languages and Systems (LOPLAS)Association for Computing Machinery

Published: Mar 1, 1993

There are no references for this article.