{"type":"ScholarlyArticle","title":"A Unifying Formal Approach to Importance Values in Boolean Functions","authors":[{"name":"Hans Harder","slug":"hans-harder","given":"Hans","family":"Harder","affiliation":"University of Paderborn; Dresden University of Technology"},{"name":"Simon Jantsch","slug":"simon-jantsch","given":"Simon","family":"Jantsch","affiliation":"Dresden University of Technology"},{"name":"Christel Baier","slug":"christel-baier","given":"Christel","family":"Baier","affiliation":"Dresden University of Technology; Centre for Tactile Internet with Human-in-the-Loop (CeTI)"},{"name":"Clemens Dubslaff","slug":"clemens-dubslaff","given":"Clemens","family":"Dubslaff","affiliation":"Eindhoven University of Technology; Centre for Tactile Internet with Human-in-the-Loop (CeTI)"}],"abstract":"Boolean functions and their representation through logics, circuits, machine learning classifiers, or binary decision diagrams (BDDs) play a central role in the design and analysis of computing systems. Quantifying the relative impact of variables on the truth value by means of importance values can provide useful insights to steer system design and debugging. In this paper, we introduce a uniform framework for reasoning about such values, relying on a generic notion of importance value functions (IVFs). The class of IVFs is defined by axioms motivated from several notions of importance values introduced in the literature, including Ben-Or and Linial’s influence and Chockler, Halpern, and Kupferman’s notion of responsibility and blame. We establish a connection between IVFs and game-theoretic concepts such as Shapley and Banzhaf values, both of which measure the impact of players on outcomes in cooperative games. Exploiting BDD-based symbolic methods and projected model counting, we devise and evaluate practical computation schemes for IVFs.","doi":"10.24963/ijcai.2023/304","url":"https://ijcai.org/proceedings/2023/304","pdf":"https://ijcai.org/proceedings/2023/0304.pdf","markdown":"https://ijcai.org/proceedings/2023/304.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/304","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":304,"pages":{"first":2728,"last":2737},"keywords":["Constraint Satisfaction and Optimization: CSO: Satisfiabilty","AI Ethics, Trust, Fairness: ETF: Explainability and interpretability","Game Theory and Economic Paradigms: GTEP: Cooperative games"],"videos":[],"references":[{"position":1,"raw":"[Ashenhurst, 1957] Robert Ashenhurst. The Decomposition of Switching Functions. In Proceedings of an Interna- tional Symposium on the Theory of Switching, April 1957.","title":"The Decomposition of Switching Functions","authors":"Robert Ashenhurst","year":"1957","venue":"Proceedings of an International Symposium on the Theory of Switching","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aziz et al., 2015] Rehan Abdul Aziz, Geoffrey Chu, Chris- tian Muise, and Peter Stuckey. #∃SAT: Projected model counting. In International Conference on Theory and Applications of Satisfiability Testing, pages 121-137. Springer, 2015.","title":"#∃SAT: Projected model counting","authors":"Rehan Abdul, Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey","year":"2015","venue":"International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Banzhaf, 1965] John Francis Banzhaf. Weighted Voting Doesn't Work: A Mathematical Analysis. Rutgers Law Review, 19:317-343, 1965.","title":"Weighted Voting Doesn't Work: A Mathematical Analysis","authors":"John Francis, Banzhaf","year":"1965","venue":"Rutgers Law Review","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bartlett and Andrews, 2001] L. M. Bartlett and J. D. An- drews. Comparison of two new approaches to variable ordering for binary decision diagrams. Quality and Re- liability Engineering International, 17(3):151-158, May 2001.","title":"Comparison of two new approaches to variable ordering for binary decision diagrams","authors":"L M Bartlett, J D","year":"2001","venue":"Quality and Reliability Engineering International","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ben-Or and Linial, 1985] Michael Ben-Or and Nathan Linial. Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values. In 26th Annual Sympo- sium on Foundations of Computer Science (Sfcs 1985), pages 408-416, Portland, OR, USA, 1985. IEEE.","title":"Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values","authors":"Michael Ben, -Or, Nathan Linial","year":"1985","venue":"26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Jan C. Bioch. Decomposition of Boolean Functions. In Yves Crama and Peter L. Hammer, editors, Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pages 39-76. Cambridge Uni- versity Press, first edition, June 2010.","title":"Decomposition of Boolean Functions","authors":"Jan C Bioch","year":"2010","venue":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Birnbaum and Esary, 1965] Zygmunt Wilhelm Birnbaum Birnbaum and J. D. Esary. Modules of Coherent Binary Systems. Journal of the Society for Industrial and Applied Mathematics, 13(2):444-462, June 1965.","title":"Modules of Coherent Binary Systems","authors":"Zygmunt Wilhelm, Birnbaum Birnbaum, J D Esary","year":"1965","venue":"Journal of the Society for Industrial and Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Biswas and Sarkar, 2021] Aniruddha Biswas and Palash Sarkar. Influence of a set of variables on a boolean func- tion. Electron. Colloquium Comput. Complex., TR21-111, 2021.","title":"Influence of a set of variables on a boolean function","authors":"Sarkar Biswas, Aniruddha Biswas, Palash Sarkar","year":"2021","venue":"Electron. Colloquium Comput. Complex","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bryant, 1992] Randal E. Bryant. Symbolic Boolean ma- nipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.","title":"Symbolic Boolean manipulation with ordered binary-decision diagrams","authors":"Randal E Bryant","year":"1992","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chockler and Halpern, 2004] Hana Chockler and Joseph Y. Halpern. Responsibility and Blame: A Structural-Model Approach. Journal of Artificial Intelligence Research, 22:93-115, October 2004.","title":"Responsibility and Blame: A Structural-Model Approach","authors":"Halpern ; ] Chockler, Hana Chockler, Joseph Y Halpern","year":"2004","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":"/proceedings/2003/21"},{"position":11,"raw":"[Chockler et al., 2008] Hana Chockler, Joseph Y. Halpern, and Orna Kupferman. What Causes a System to Satisfy a Specification? ACM Transactions on Computational Logic, 9(3):1-26, June 2008.","title":"What Causes a System to Satisfy a Specification?","authors":"Hana Chockler, Joseph Y Halpern, Orna Kupferman","year":"2008","venue":"ACM Transactions on Computational Logic","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Compile! Project, 2023] Compile! Project. Benchmarks. https://www.cril.univ-artois.fr/kc/benchmarks.html, 2023. Accessed: 2023-01-11.","title":"Compile! Project. Benchmarks","authors":null,"year":"2023","venue":null,"doi":null,"url":"https://www.cril.univ-artois.fr/kc/benchmarks.html","internal_url":null},{"position":13,"raw":"[Crama and Hammer, 2011a] Yves Crama and Peter L. Hammer. Boolean Functions: Theory, Algorithms, and Applications. Encyclopedia of Mathematics and its Appli- cations. Cambridge University Press, 2011.","title":"Boolean Functions: Theory, Algorithms, and Applications. Encyclopedia of Mathematics and its Applications","authors":"Hammer Crama, Yves Crama, Peter L Hammer","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Crama and Hammer, 2011b] Yves Crama and Peter L. Hammer. Orthogonal forms and shellability. In Boolean Functions: Theory, Algorithms, and Applications, Ency- clopedia of Mathematics and Its Applications, chapter 7, pages 326-350. Cambridge University Press, Cambridge, 2011.","title":"Orthogonal forms and shellability","authors":"Hammer Crama, Yves Crama, Peter L Hammer","year":"2011","venue":"Boolean Functions: Theory, Algorithms, and Applications, Encyclopedia of Mathematics and Its Applications","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Davidson, 1999] Scott Davidson. Itc'99 benchmark circuits-preliminary results. In International Test Con- ference 1999. Proceedings (IEEE Cat. No. 99CH37034), pages 1125-1125. IEEE, 1999.","title":"Itc'99 benchmark circuits-preliminary results","authors":"Davidson ;, Scott Davidson","year":"1999","venue":"International Test Conference 1999. Proceedings (IEEE Cat. No. 99CH37034","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Deng and Papadimitriou, 1994] Xiaotie Deng and Chris- tos H. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2):257-266, 1994.","title":"Xiaotie Deng and Christos H. Papadimitriou. On the complexity of cooperative solution concepts","authors":"Papadimitriou Deng","year":"1994","venue":"Mathematics of Operations Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Dubslaff et al., 2022] Clemens Dubslaff, Kallistos Weis, Christel Baier, and Sven Apel. Causality in configurable software systems. In Proceedings of the 44th Interna- tional Conference on Software Engineering, ICSE '22, page 325-337, New York, NY, USA, 2022. Association for Computing Machinery.","title":"Causality in configurable software systems","authors":"Clemens Dubslaff, Kallistos Weis, Christel Baier, Sven Apel","year":"2022","venue":"Proceedings of the 44th International Conference on Software Engineering, ICSE '22","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Faigle and Kern, 1992] Ulrich Faigle and Walter Kern. The shapley value for cooperative games under precedence constraints. International Journal of Game Theory, 21(3):249-266, 1992.","title":"The shapley value for cooperative games under precedence constraints","authors":"Kern Faigle, Ulrich Faigle, Walter Kern","year":"1992","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Golomb, 1959] Solomon Golomb. On the classification of Boolean functions. IRE Transactions on Information The- ory, 5(5):176-186, May 1959.","title":"Solomon Golomb. On the classification of Boolean functions","authors":"Golomb","year":"1959","venue":"IRE Transactions on Information Theory","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hammer et al., 2000] Peter L. Hammer, Alexander Kogan, and Uriel G. Rothblum. Evaluation, Strength, and Rele- vance of Variables of Boolean Functions. SIAM Journal on Discrete Mathematics, 13(3):302-312, January 2000.","title":"Evaluation, Strength, and Relevance of Variables of Boolean Functions","authors":"L Peter, Alexander Hammer, Uriel G Kogan, Rothblum","year":"2000","venue":"SIAM Journal on Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Hooker and Vinay, 1995] John N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15(3):359-383, 1995.","title":"Branching rules for satisfiability","authors":"John N Hooker, V Vinay","year":"1995","venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Jeroslow and Wang, 1990] Robert G. Jeroslow and Jin- chang Wang. Solving propositional satisfiability prob- lems. Annals of Mathematics and Artificial Intelligence, 1(1-4):167-187, September 1990.","title":"Solving propositional satisfiability problems","authors":"Robert G Jeroslow, Jinchang Wang","year":"1990","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kahn et al., 1988] Jeff Kahn, Gil Kalai, and Nathan Linial. The Influence of Variables on Boolean Functions. In [Pro- ceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pages 68-80, October 1988.","title":"The Influence of Variables on Boolean Functions","authors":"Jeff Kahn, Gil Kalai, Nathan Linial","year":"1988","venue":"Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Lind-Nielsen, 1999] Jørn Lind-Nielsen. BuDDy: A binary decision diagram package. Department of Information Technology, Technical University of Denmark, 1999.","title":"BuDDy: A binary decision diagram package","authors":"Jørn Lind-Nielsen","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Marques-Silva, 1999] João Marques-Silva. The Impact of Branching Heuristics in Propositional Satisfiability Algo- rithms. In G. Goos, J. Hartmanis, J. van Leeuwen, Pe- dro Barahona, and José J. Alferes, editors, Progress in Ar- tificial Intelligence, volume 1695, pages 62-74. Springer Berlin Heidelberg, Berlin, Heidelberg, 1999.","title":"The Impact of Branching Heuristics in Propositional Satisfiability Algorithms","authors":"João Marques-Silva","year":"1999","venue":"Progress in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[O'Donnell, 2014] Ryan O'Donnell. Analysis of boolean functions. Cambridge University Press, 2014.","title":"Analysis of boolean functions","authors":"O' Ryan, Donnell","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Shapley, 1953] Loyd. S. Shapley. A Value for n-Person Games. In Harold William Kuhn and Albert William Tucker, editors, Contributions to the Theory of Games II, pages 307-318. Princeton University Press, December 1953.","title":"A Value for n-Person Games","authors":"Loyd S Shapley","year":"1953","venue":"Contributions to the Theory of Games II","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Shapley, 1967] Lloyd S. Shapley. Compound simple games, III: On committees. Technical report, RAND CORP SANTA MONICA CA, 1967.","title":"Compound simple games, III: On committees","authors":"Lloyd S Shapley","year":"1967","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Slepian, 1953] David Slepian. On The Number of Symme- try Types of Boolean Functions of n Variables. Canadian Journal of Mathematics, 5:185-193, 1953.","title":"On The Number of Symmetry Types of Boolean Functions of n Variables","authors":"David Slepian","year":"1953","venue":"Canadian Journal of Mathematics","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Suzuki et al., 2015] Ryosuke Suzuki, Kenji Hashimoto, and Masahiko Sakai. An Extension of a DPLL-Based Model- Counting Solver for Projected Model. JSAI Technical Re- port, SIG-FPAI-97-B404:59-64, March 2015.","title":"An Extension of a DPLL-Based Model-Counting Solver for Projected Model","authors":"Ryosuke Suzuki, Kenji Hashimoto, Masahiko Sakai","year":"2015","venue":"JSAI Technical Report","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Suzuki et al., 2017] Ryosuke Suzuki, Kenji Hashimoto, and Masahiko Sakai. Improvement of Projected Model- Counting Solver with Component Decomposition Using SAT Solving in Components. JSAI Technical Report, SIG- FPAI-103-B506:31-36, March 2017.","title":"Improvement of Projected Model-Counting Solver with Component Decomposition Using SAT Solving in Components","authors":"Ryosuke Suzuki, Kenji Hashimoto, Masahiko Sakai","year":"2017","venue":"JSAI Technical Report","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Traxler, 2009] Patrick Traxler. Variable influences in con- junctive normal forms. In International Conference on Theory and Applications of Satisfiability Testing, pages 101-113. Springer, 2009.","title":"Variable influences in conjunctive normal forms","authors":"Patrick Traxler, Traxler","year":"2009","venue":"International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}