@Article{Mar-Son_LOPLAS93,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Precise and Efficient Groundness Analysis for Logic Programs},
  journal   = {ACM Letters on Programming Languages and Systems},
  volume    = {2},
  number    = {1--4},
  pages	    = {181--196},
  year	    = {1993},
  doi       = {10.1145/176454.176519},
  abstract  = {We show how precise groundness information can be extracted from
		logic programs. The idea is to use abstract interpretation with
		Boolean functions as ``approximations'' to groundness 
		dependencies between variables. This idea is not new, and 
		different classes of Boolean functions have been used. We argue,
		however, that one class, the \emph{positive} functions, is more 
		suitable than others. Positive Boolean functions have a certain
		property which we (inspired by A. Langen) call ``condensation.''
		This property allows for rapid computation of groundness 
		information.},
  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis},
}

{"_id":"SGujQzXr7Zt7o2vui","bibbaseid":"marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993","author_short":["Marriott, K.","Søndergaard, H."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Kim"],"propositions":[],"lastnames":["Marriott"],"suffixes":[]},{"firstnames":["Harald"],"propositions":[],"lastnames":["Søndergaard"],"suffixes":[]}],"title":"Precise and Efficient Groundness Analysis for Logic Programs","journal":"ACM Letters on Programming Languages and Systems","volume":"2","number":"1–4","pages":"181–196","year":"1993","doi":"10.1145/176454.176519","abstract":"We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as ``approximations'' to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the \\emphpositive functions, is more suitable than others. Positive Boolean functions have a certain property which we (inspired by A. Langen) call ``condensation.'' This property allows for rapid computation of groundness information.","keywords":"Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis","bibtex":"@Article{Mar-Son_LOPLAS93,\n author = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n title\t = {Precise and Efficient Groundness Analysis for Logic Programs},\n journal = {ACM Letters on Programming Languages and Systems},\n volume = {2},\n number = {1--4},\n pages\t = {181--196},\n year\t = {1993},\n doi = {10.1145/176454.176519},\n abstract = {We show how precise groundness information can be extracted from\n\t\tlogic programs. The idea is to use abstract interpretation with\n\t\tBoolean functions as ``approximations'' to groundness \n\t\tdependencies between variables. This idea is not new, and \n\t\tdifferent classes of Boolean functions have been used. We argue,\n\t\thowever, that one class, the \\emph{positive} functions, is more \n\t\tsuitable than others. Positive Boolean functions have a certain\n\t\tproperty which we (inspired by A. Langen) call ``condensation.''\n\t\tThis property allows for rapid computation of groundness \n\t\tinformation.},\n keywords = {Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis},\n}\n\n","author_short":["Marriott, K.","Søndergaard, H."],"key":"Mar-Son_LOPLAS93","id":"Mar-Son_LOPLAS93","bibbaseid":"marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993","role":"author","urls":{},"keyword":["Abstract interpretation","Abstract domains","Logic programming","Boolean logic","Groundness analysis"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://raw.githubusercontent.com/zarajoy/testbibtex/refs/heads/main/test.bib","dataSources":["yWvm3kzg5vKQAPLm7","ofmsZryxNDBSpE7j5","9aC4cxLD8D6oJ3FLN","wpkuJrZJJtqra3FbL","W7ih7WyQivP4EDh83","BNGFBQQncqevukxoe","q5pWX4XZgAS4TQBof","yb3uN577XrYa7qf57","9jmvjAEoFta6emcgS","XqcrNTrCCBr9mSd37"],"keywords":["abstract interpretation","abstract domains","logic programming","boolean logic","groundness analysis"],"search_terms":["precise","efficient","groundness","analysis","logic","programs","marriott","søndergaard"],"title":"Precise and Efficient Groundness Analysis for Logic Programs","year":1993}