{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:54Z","timestamp":1725664194777},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:28:01Z","timestamp":1330273681000},"page":"266-280","source":"Crossref","is-referenced-by-count":16,"title":["Boolean functions for dependency analysis: Algebraic properties and efficient representation"],"prefix":"10.1007","author":[{"given":"Tania","family":"Armstrong","sequence":"first","affiliation":[]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"17_CR1","volume-title":"Technical Report 94\/10","author":"T. Armstrong","year":"1994","unstructured":"T. Armstrong, K. Marriott, P. Schachte, and H. S\u00f8ndergaard. Two Classes of Boolean Functions for Dependency Analysis. Technical Report 94\/10, Dept. of Computer Science, The University of Melbourne, Australia, 1994."},{"key":"17_CR2","unstructured":"N. Baker and H. S\u00f8ndergaard. Definiteness analysis for CLP(-280-01). In G. Gupta, G. Mohay and R. Topor, editors, Proc. Sixteenth Australian Computer Science Conf., pages 321\u2013332. Brisbane, Qld., January 1993."},{"key":"17_CR3","unstructured":"P. Bigot, S. Debray and K. Marriott. Understanding finiteness analysis using abstract interpretation. In K. Apt, editor, Logic Programming: Proc. Joint Int. Conf. Symp., pages 735\u2013749. MIT Press, 1992."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"K. Brace, R. Rudell and R. Bryant. Efficient implementation of a BDD package. Proc. 27th ACM\/IEEE Design Automation Conf., pages 40\u201345. IEEE Comp. Soc. Press, 1990.","DOI":"10.1145\/123186.123222"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publ., 1990.","DOI":"10.1007\/978-1-4757-2078-5"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. Bryant","year":"1992","unstructured":"R. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys\n24 (3): 293\u2013318, 1992.","journal-title":"ACM Computing Surveys"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293\u2013322. Plenum Press, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"17_CR8","unstructured":"M. Codish and B. Demoen. Analysing logic programs using \u201cProp\u201d-ositional logic programs and a magic wand. In D. Miller, editor, Logic Programming: Proc. 1993 Int. Symp., pages 114\u2013129. MIT Press, 1993."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e9 and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. Proc. Sixth Ann. IEEE Symp. Logic in Computer Science, pages 322\u2013327. Amsterdam, The Netherlands, 1991.","DOI":"10.1109\/LICS.1991.151656"},{"key":"17_CR10","volume-title":"PhD thesis","author":"P. Dart","year":"1988","unstructured":"P. Dart. Dependency Analysis and Query Interfaces for Deductive Databases. PhD thesis, The University of Melbourne, Australia, 1988."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0743-1066(91)90017-J","volume":"11","author":"P. Dart","year":"1991","unstructured":"P. Dart. On derived dependencies and connected databases. Journal of Logic Programming\n11 (2): 163\u2013188, 1991.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W. Dowling","year":"1984","unstructured":"W. Dowling, and J. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming\n1 (3): 267\u2013284, 1984.","journal-title":"Journal of Logic Programming"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"B. Le Charlier and P. Van Hentenryck. Groundness analysis for Prolog: Implementation and evaluation of the domain Prop. Proc. ACM Symp. Partial Evaluation and Semantics-Based Program Manipulation, pages 99\u2013110, Copenhagen, Denmark, June 1993.","DOI":"10.1145\/154630.154641"},{"key":"17_CR14","unstructured":"K. Marriott and H. S\u00f8ndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conf. Logic Programming, Cleveland, Ohio, 1989."},{"key":"17_CR15","unstructured":"K. Marriott, H. S\u00f8ndergaard, and N. D. Jones Denotational abstract interpretation of logic programs. To appear in ACM Trans. Programming Languages and Systems."},{"key":"17_CR16","unstructured":"W. V. Quine. Methods of Logic. Harvard University Press, Fourth ed., 1982."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"R. Ramakrishnan, F. Bancilhon and A. Silberschatz. Safety of recursive Horn clauses with infinite relations. Proc. Sixth A CM Symp. Principles of Database Systems, pages 328\u2013339. ACM Press, 1987.","DOI":"10.1145\/28659.28694"},{"key":"17_CR18","unstructured":"J. Zobel. Analysis of Logic Programs. PhD Thesis, The University of Melbourne, 1990."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:18:08Z","timestamp":1619572688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}