{"type":"ScholarlyArticle","title":"Locality in Random SAT Instances","authors":[{"name":"Jesús Giráldez-Cru","slug":"jesus-giraldez-cru","given":"Jesús","family":"Giráldez-Cru","affiliation":"KTH Royal Institute of Technology Stockholm , Sweden"},{"name":"Jordi Levy","slug":"jordi-levy","given":"Jordi","family":"Levy","affiliation":"IIIA-CSIC Bellaterra , Spain"}],"abstract":"Despite the success of CDCL SAT solvers solving industrial problems, there are still many open questions to explain such success. In this context, the generation of random SAT instances having computational properties more similar to real-world problems becomes crucial. Such generators are possibly the best tool to analyze families of instances and solvers behaviors on them.\r\n\r\nIn this paper, we present a random SAT instances generator based on the notion of locality. We show that this is a decisive dimension of attractiveness among the variables of a formula, and how CDCL SAT solvers take advantage of it. To the best of our knowledge, this is the first random SAT model that generates both scale-free structure and community structure at once.","doi":"10.24963/ijcai.2017/89","url":"https://ijcai.org/proceedings/2017/89","pdf":"https://ijcai.org/proceedings/2017/0089.pdf","markdown":"https://ijcai.org/proceedings/2017/89.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/89","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":89,"pages":{"first":638,"last":644},"keywords":["Constraints and Satisfiability: Satisfiability","Constraints and Satisfiability: Solvers and Tools","Constraints and Satisfiability: Modeling/Formulation"],"videos":[],"references":[{"position":1,"raw":"[Ansótegui et al., 2009a] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. On the structure of industrial SAT instances. In Proc. of the 15th Int. Conf. on Principles and Practice of Constraint Programming (CP'09), pages 127- 141, 2009.","title":"On the structure of industrial SAT instances","authors":"Ansótegui","year":"2009","venue":"Proc. of the 15th Int. Conf. on Principles and Practice of Constraint Programming (CP'09)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ansótegui et al., 2009b] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. Towards industrial-like random SAT instances. In Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09), pages 387-392, 2009.","title":"Towards industrial-like random SAT instances","authors":"Ansótegui","year":"2009","venue":"Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09)","doi":null,"url":null,"internal_url":"/proceedings/2009/72"},{"position":3,"raw":"[Ansótegui et al., 2012] Carlos Ansótegui, Jesús Giráldez- Cru, and Jordi Levy. The community structure of SAT formulas. In Proc. of the 15th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'12), pages 410- 423, 2012.","title":"The community structure of SAT formulas","authors":"Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy","year":"2012","venue":"Proc. of the 15th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'12)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ansótegui et al., 2014] Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, and Jordi Levy. The fractal dimension of SAT formulas. In Proc. of the 7th Int. Joint Conf. on Automated Reasoning (IJCAR'14), pages 107- 121, 2014.","title":"The fractal dimension of SAT formulas","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy","year":"2014","venue":"Proc. of the 7th Int. Joint Conf. on Automated Reasoning (IJCAR'14)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ansótegui et al., 2015] Carlos Ansótegui, Jesús Giráldez- Cru, Jordi Levy, and Laurent Simon. Using community structure to detect relevant learnt clauses. In Proc. of the 18th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'15), pages 238-254, 2015.","title":"Using community structure to detect relevant learnt clauses","authors":"Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon","year":"2015","venue":"Proc. of the 18th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'15)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ansótegui et al., 2016] Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, and Jordi Levy. Community structure in industrial SAT instances. arXiv, 1606.03329, 2016.","title":"Community structure in industrial SAT instances","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Audemard and Simon, 2009] Gilles Audemard and Laurent Simon. Predicting learnt clauses quality in modern SAT solvers. In Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09), pages 399-404, 2009.","title":"Predicting learnt clauses quality in modern SAT solvers","authors":"Simon ; Audemard, Gilles Audemard, Laurent Simon","year":"2009","venue":"Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI'09)","doi":null,"url":null,"internal_url":"/proceedings/2009/74"},{"position":8,"raw":"[Barabási and Albert, 1999] Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.","title":"Emergence of scaling in random networks","authors":"Albert ; Albert-László Barabási, Réka Barabási, Albert","year":"1999","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dechter, 2003] Rina Dechter. Constraint Processing. Mor- gan Kaufmann, 2003.","title":"Constraint Processing","authors":"Rina Dechter","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Freeman, 1995] J. W. Freeman. Improvements to Proposi- tional Satisfiability Search Algorithms. PhD thesis, Uni- versity of Pennsylvania, Philadelphia, 1995.","title":"Improvements to Propositional Satisfiability Search Algorithms","authors":"J W Freeman","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Friedrich et al., 2017] Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, and Andrew M. Sutton. Phase tran- sition for sclae-free SAT formulas. In Proc. of the 31st National Conf. on Artificial Intelligence (AAAI'17), 2017.","title":"Phase transition for sclae-free SAT formulas","authors":"Friedrich","year":"2017","venue":"Proc. of the 31st National Conf. on Artificial Intelligence (AAAI'17)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Giráldez-Cru and Levy, 2015] Jesús Giráldez-Cru and Jordi Levy. A modularity-based random SAT instances genera- tor. In Proc. of the 24th Int. Joint Conf. on Artificial Intel- ligence (IJCAI'15), pages 1952-1958, 2015.","title":"Jesús Giráldez-Cru and Jordi Levy. A modularity-based random SAT instances generator","authors":"Giráldez-Cru, Levy","year":"2015","venue":"Proc. of the 24th Int. Joint Conf. on Artificial Intelligence (IJCAI'15)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Giráldez-Cru and Levy, 2016] Jesús Giráldez-Cru and Jordi Levy. Generating SAT instances with community struc- ture. Artif. Intell., 238:119-134, 2016.","title":"Jesús Giráldez-Cru and Jordi Levy. Generating SAT instances with community structure","authors":"Giráldez-Cru, Levy","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Heule et al., 2004] Marijn J. H. Heule, Joris E. van Zwieten, Mark Dufour, and Hans van Maaren. March eq: Imple- menting additional reasoning into an efficient Look-ahead SAT solver. In Proc. of the 7th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'04), pages 345- 359, 2004.","title":"March eq: Implementing additional reasoning into an efficient Look-ahead SAT solver","authors":"J H Marijn, Joris E Heule, Mark Van Zwieten, Hans Dufour, Van Maaren","year":"2004","venue":"Proc. of the 7th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'04)","doi":null,"url":null,"internal_url":null},{"position":15,"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):167-187, 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":16,"raw":"[Katsirelos and Simon, 2012] George Katsirelos and Laurent Simon. Eigenvector centrality in industrial SAT instances. In Proc. of the 18th Int. Conf. on Principles and Practice of Constraint Programming (CP'12), pages 348-356, 2012.","title":"Eigenvector centrality in industrial SAT instances","authors":"Simon ; Katsirelos, George Katsirelos, Laurent Simon","year":"2012","venue":"Proc. of the 18th Int. Conf. on Principles and Practice of Constraint Programming (CP'12)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kautz and Selman, 2003] Henry A. Kautz and Bart Selman. Ten challenges redux: Recent progress in propositional reasoning and search. In Proc. of the 9th Int. Conf. on Prin- ciples and Practice of Constraint Programming (CP'03), pages 1-18, 2003.","title":"Ten challenges redux: Recent progress in propositional reasoning and search","authors":"Henry A Kautz, Bart Selman","year":"2003","venue":"Proc. of the 9th Int. Conf. on Principles and Practice of Constraint Programming (CP'03)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kautz and Selman, 2007] Henry A. Kautz and Bart Sel- man. The state of SAT. Discrete Applied Mathematics, 155(12):1514-1524, 2007.","title":"The state of SAT","authors":"Henry A Kautz, Bart Selman","year":"2007","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Marques-Silva, 1999] Joao P. Marques-Silva. The impact of branching heuristics in propositional satisfiability algo- rithms. In Proc. of the 9th Portuguese Conf. on Artificial Intelligence: Progress in Artificial Intelligence (EPIA'99), volume 1695 of LNCS, pages 62-74, 1999.","title":"The impact of branching heuristics in propositional satisfiability algorithms","authors":"Joao P Marques-Silva","year":"1999","venue":"Proc. of the 9th Portuguese Conf. on Artificial Intelligence: Progress in Artificial Intelligence (EPIA'99)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Moskewicz et al., 2001] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient sat solver. In Proc. of the 38th Annual Design Automation Conf. (DAC'01), pages 530-535, 2001.","title":"Chaff: Engineering an efficient sat solver","authors":"Matthew W Moskewicz, F Conor, Ying Madigan, Lintao Zhao, Sharad Zhang, Malik","year":"2001","venue":"Proc. of the 38th Annual Design Automation Conf. (DAC'01)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Mull et al., 2016] Nathan Mull, Daniel J. Fremont, and San- jit A. Seshia. On the hardness of SAT with community structure. In Proc. of the 19th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'16), pages 141- 159, 2016.","title":"On the hardness of SAT with community structure","authors":"Nathan Mull, Daniel J Fremont, Sanjit A Seshia","year":"2016","venue":"Proc. of the 19th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'16)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Papadopoulos et al., 2012] Fragkiskos Papadopoulos, Mak- sim Kitsak, M. Ángeles Serrano, Marián Boguñá, and Dimitri Krioukov. Popularity versus similarity in growing networks. Nature, 489:537-540, 2012.","title":"Popularity versus similarity in growing networks","authors":"Papadopoulos","year":"2012","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Selman et al., 1997] Bart Selman, Henry A. Kautz, and David A. McAllester. Ten challenges in propositional rea- soning and search. In Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI'97), pages 50-54, 1997.","title":"Ten challenges in propositional reasoning and search","authors":"Bart Selman, Henry A Kautz, David A Mcallester","year":"1997","venue":"Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI'97)","doi":null,"url":null,"internal_url":"/proceedings/1997/8"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}