{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:31:37Z","timestamp":1778301097300,"version":"3.51.4"},"reference-count":45,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5556,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0167-6423(96)00039-1","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T16:12:04Z","timestamp":1036080724000},"page":"3-45","source":"Crossref","is-referenced-by-count":53,"title":["Two classes of Boolean functions for dependency analysis"],"prefix":"10.1016","volume":"31","author":[{"given":"Tania","family":"Armstrong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(96)00039-1_BIB1","series-title":"Static Analysis: Proc. 1st Internat. Symp.","first-page":"266","article-title":"Boolean functions for dependency analysis: algebraic properties and efficient representation","volume":"vol. 864","author":"Armstrong","year":"1994"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB2","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/320610.320620","article-title":"Decompositions and functional dependencies in relations","volume":"5","author":"Armstrong","year":"1980","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB3","series-title":"Proc. 16th Australian Computer Science Conf.","first-page":"321","article-title":"Definiteness analysis for CLP(R)","author":"Baker","year":"1993"},{"issue":"1","key":"10.1016\/S0167-6423(96)00039-1_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/151646.151650","article-title":"A general framework for semantics-based bottom-up abstract interpretation of logic programs","volume":"15","author":"Barbuti","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB5","series-title":"Logic Programming: Proc. Joint Internat. Conf. Symp.","first-page":"735","article-title":"Understanding finiteness analysis using abstract interpretation","author":"Bigot","year":"1992"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB6","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1145\/1634.1639","article-title":"Algebraic structures with hard equivalence and minimization problems","volume":"31","author":"Bloniarz","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB7","series-title":"Proc. TAPSOFT '91, vol. 2","first-page":"153","article-title":"Proving termination of logic programs by exploiting term properties","volume":"vol. 494","author":"Bossi","year":"1991"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB8","series-title":"Proc. 27th ACM\/IEEE Design Automation Conf.","first-page":"40","article-title":"Efficient implementation of a BDD package","author":"Brace","year":"1990"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB9","series-title":"Boolean Reasoning: The Logic of Boolean Equations","author":"Brown","year":"1990"},{"issue":"3","key":"10.1016\/S0167-6423(96)00039-1_BIB10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic Boolean manipulation with ordered binary-decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB11","article-title":"Model Theory","volume":"vol. 73","author":"Chang","year":"1973"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB12","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"issue":"1","key":"10.1016\/S0167-6423(96)00039-1_BIB13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(94)90055-8","article-title":"Bottom-up abstract interpretation of logic programs","volume":"124","author":"Codish","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(96)00039-1_BIB14","first-page":"114","article-title":"Analysing logic programs using \u201cProp\u201d-ositional logic programs and a magic wand","author":"Codish","year":"1993"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB15","series-title":"Static Analysis: Proc. 1st Internat. Symp.","first-page":"281","article-title":"Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop","volume":"vol. 864","author":"Codish","year":"1994"},{"issue":"3","key":"10.1016\/S0167-6423(96)00039-1_BIB16","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/177492.177656","article-title":"Suspension analyses for concurrent logic programs","volume":"16","author":"Codish","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB17","series-title":"Proc. 4th IEEE Internat. Conf. Computer Languages","first-page":"155","article-title":"Computations, abstractions and constraints in logic programs","author":"Codognet","year":"1992"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB18","series-title":"Proc. 3rd Ann. ACM Symp. Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB19","series-title":"Programming Language Implementation and Logic Programming","first-page":"75","article-title":"Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains","volume":"vol. 714","author":"Corsini","year":"1993"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB20","series-title":"Proc. 6th Ann. IEEE Symp. Logic in Computer Science","first-page":"322","article-title":"Prop revisited: Propositional formula as abstract domain for groundness analysis","author":"Cortesi","year":"1991"},{"issue":"3","key":"10.1016\/S0167-6423(96)00039-1_BIB21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","article-title":"Evaluation of the domain Prop","volume":"23","author":"Cortesi","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB22","article-title":"Dependency analysis and query interfaces for deductive databases","author":"Dart","year":"1988"},{"issue":"2","key":"10.1016\/S0167-6423(96)00039-1_BIB23","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0743-1066(91)90017-J","article-title":"On derived dependencies and connected databases","volume":"11","author":"Dart","year":"1991","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/S0167-6423(96)00039-1_BIB24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB25","series-title":"Proc. 4th Internat. Conf. Algebraic Methodology and Software Technology (AMAST'95)","first-page":"531","article-title":"Confluence and concurrent constraint programming","volume":"vol. 936","author":"Falaschi","year":"1995"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB26","series-title":"Logic Programming: Proc. 1994 Internat. Symp.","first-page":"655","article-title":"Improving abstract interpretations by systematic lifting to the powerset","author":"Fil\u00e9","year":"1994"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB27","article-title":"Semantic aspects of logic program analysis","author":"Giacobazzi","year":"1993"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB28","series-title":"Grundlagen der Mathematik","author":"Hilbert","year":"1934"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB29","article-title":"Advanced techniques for approximating variables in logic programs","author":"Langen","year":"1991"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB30","series-title":"North American Conf. Logic Programming","article-title":"Notes for a tutorial on abstract interpretation of logic programs","author":"Marriott","year":"1989"},{"issue":"1\u20134","key":"10.1016\/S0167-6423(96)00039-1_BIB31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/176454.176519","article-title":"Precise and efficient groundness analysis for logic programs","volume":"2","author":"Marriott","year":"1993","journal-title":"ACM Lett. Programming Languages Systems"},{"issue":"3","key":"10.1016\/S0167-6423(96)00039-1_BIB32","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/177492.177650","article-title":"Denotational abstract interpretation of logic programs","volume":"16","author":"Marriott","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB33","series-title":"Static Analysis: Proc. 1st Internat. Symp.","first-page":"363","article-title":"Abstract interpretation using TDGs","volume":"vol. 864","author":"Mauborgne","year":"1994"},{"issue":"1","key":"10.1016\/S0167-6423(96)00039-1_BIB34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","article-title":"Some global optimizations for a Prolog compiler","volume":"2","author":"Mellish","year":"1985","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/S0167-6423(96)00039-1_BIB35","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1305\/ndjfl\/1093635508","article-title":"Post's functional completeness theorem","volume":"31","author":"Pelletier","year":"1990","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB36","series-title":"Proc. 6th ACM Symp. Principles of Database Systems","first-page":"328","article-title":"Safety of recursive Horn clauses with infinite relations","author":"Ramakrishnan","year":"1987"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB37","article-title":"An Algebraic Approach to Non-Classical Logics","volume":"vol. 78","author":"Rasiowa","year":"1974"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB38","article-title":"The Mathematics of Metamathematics","volume":"vol. 41","author":"Rasiowa","year":"1963"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB39","series-title":"Concurrent Constraint Programming Languages","author":"Saraswat","year":"1990"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB40","series-title":"Der Operationskreis des Logikkalkuls","author":"Schr\u00f6der","year":"1877"},{"issue":"3","key":"10.1016\/S0167-6423(96)00039-1_BIB41","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/72551.72555","article-title":"The family of concurrent logic programming languages","volume":"21","author":"Shapiro","year":"1989","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB42","series-title":"Proc. ESOP 86","first-page":"327","article-title":"An application of abstract interpretation of logic programs: Occur check reduction","volume":"vol. 213","author":"S\u00f8ndergaard","year":"1986"},{"issue":"2","key":"10.1016\/S0167-6423(96)00039-1_BIB43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF03037201","article-title":"The languages FCP(:,?) and FCP(:)","volume":"7","author":"Yardeni","year":"1990","journal-title":"New Generation Comput."},{"key":"10.1016\/S0167-6423(96)00039-1_BIB44","article-title":"Analysis of logic programs","author":"Zobel","year":"1990"},{"key":"10.1016\/S0167-6423(96)00039-1_BIB45","article-title":"On logic programs, functional dependencies, and types","author":"Zobel","year":"1990"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642396000391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642396000391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T05:29:37Z","timestamp":1555392577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642396000391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167642396000391"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(96)00039-1","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}