{"type":"ScholarlyArticle","title":"Generating Hard Random Boolean Formulas and Disjunctive Logic Programs","authors":[{"name":"Giovanni Amendola","slug":"giovanni-amendola","given":"Giovanni","family":"Amendola","affiliation":"University of Edinburgh , UK"},{"name":"Francesco Ricca","slug":"francesco-ricca","given":"Francesco","family":"Ricca","affiliation":"University of Calabria , Italy"},{"name":"Miroslaw Truszczynski","slug":"miroslaw-truszczynski","given":"Miroslaw","family":"Truszczynski","affiliation":"University of Kentucky , USA"}],"abstract":"We propose a model of random quantified boolean formulas and their natural random disjunctive logic program counterparts. The model extends the standard models for random SAT and 2QBF. We provide theoretical bounds for the phase transition region in the new model, and show experimentally the presence of the easy-hard-easy pattern. Importantly, we show that the model is well suited for assessing solvers tuned to real-world instances. Moreover, to the best of our knowledge, our model and results on random disjunctive logic programs are the first of their kind.","doi":"10.24963/ijcai.2017/75","url":"https://ijcai.org/proceedings/2017/75","pdf":"https://ijcai.org/proceedings/2017/0075.pdf","markdown":"https://ijcai.org/proceedings/2017/75.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/75","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":75,"pages":{"first":532,"last":538},"keywords":["Constraints and Satisfiability: Satisfiability","Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"[Achlioptas and Moore, 2002] D. Achlioptas and C. Moore. The asymptotic order of the random k-sat threshold. In FOCS 2002, pages 779-788, 2002.","title":"The asymptotic order of the random k-sat threshold","authors":"D Achlioptas, C Moore","year":"2002","venue":"FOCS 2002","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Achlioptas, 2009] D. Achlioptas. Random satisfiability. In Handbook of Satisfiability, pages 245-270. 2009.","title":"Random satisfiability","authors":"D Achlioptas","year":"2009","venue":"Handbook of Satisfiability","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alviano et al., 2015] M. Alviano, C. Dodaro, N. Leone, and F. Ricca. Advances in WASP. In LPNMR 2015, pages 40- 54, 2015.","title":"Advances in WASP","authors":"M Alviano, C Dodaro, N Leone, F Ricca","year":"2015","venue":"LPNMR 2015","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ansótegui et al., 2009] C. Ansótegui, M. L. Bonet, and J. Levy. Towards industrial-like random SAT instances. In IJCAI 2009, pages 387-392, 2009.","title":"Towards industrial-like random SAT instances","authors":"C Ansótegui, M L Bonet, J Levy","year":"2009","venue":"IJCAI 2009","doi":null,"url":null,"internal_url":"/proceedings/2009/72"},{"position":5,"raw":"[Audemard et al., 2013] G. Audemard, J-M. Lagniez, and L. Simon. Improving glucose for incremental SAT solv- ing with assumptions: Application to MUS extraction. In SAT 2013, volume 7962 of LNCS, pages 309-317, 2013.","title":"Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction","authors":"G Audemard, J-M Lagniez, L Simon","year":"2013","venue":"SAT 2013","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Biere, 2014] A. Biere. Lingeling essentials, a tutorial on design and implementation aspects of the the SAT solver lingeling. In POS-14., volume 27 of EPiC, page 88, 2014.","title":"Lingeling essentials, a tutorial on design and implementation aspects of the the SAT solver lingeling","authors":"A Biere","year":"2014","venue":"POS-14","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brewka et al., 2011] G. Brewka, T. Eiter, and M. Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"G Brewka, T Eiter, M Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brummayer et al., 2010] R. Brummayer, F. Lonsing, and A. Biere. Automated testing and debugging of SAT and QBF solvers. In SAT 2010, volume 6175 of LNCS, pages 44-57, 2010.","title":"Automated testing and debugging of SAT and QBF solvers","authors":"R Brummayer, F Lonsing, A Biere","year":"2010","venue":"SAT 2010","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Calimeri et al., 2016] F. Calimeri, M. Gebser, M. Maratea, and F. Ricca. Design and results of the fifth answer set pro- gramming competition. Artif. Intell., 231:151-181, 2016.","title":"Design and results of the fifth answer set programming competition","authors":"F Calimeri, M Gebser, M Maratea, F Ricca","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chen and Interian, 2005] H. Chen and Y. Interian. A model for generating random quantified boolean formulas. In IJ- CAI 2005, pages 66-71, 2005.","title":"A model for generating random quantified boolean formulas","authors":"H Chen, Y Interian","year":"2005","venue":"IJ-CAI 2005","doi":null,"url":null,"internal_url":"/proceedings/2005/57"},{"position":11,"raw":"[Coarfa et al., 2003] C. Coarfa, D.D. Demopoulos, A. San Miguel Aguirre, D. Subramanian, and M.Y. Vardi. Random 3-sat: The plot thickens. Constraints, 8(3):243-261, 2003.","title":"Random 3-sat: The plot thickens","authors":"C Coarfa, D D Demopoulos, A San Miguel Aguirre, D Subramanian, M Y Vardi","year":"2003","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Crawford and Auton, 1996] J.M. Crawford and L.D. Auton. Experimental results on the crossover point in random 3- sat. Artif. Intell., 81(1-2):31-57, 1996.","title":"Experimental results on the crossover point in random 3sat","authors":"J M Crawford, L D Auton","year":"1996","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Creignou et al., 2012] N. Creignou, U. Egly, and M. Seidl. A framework for the specification of random SAT and QSAT formulas. In TAP 2012, volume 7305 of LNCS, pages 163-168, 2012.","title":"A framework for the specification of random SAT and QSAT formulas","authors":"N Creignou, U Egly, M Seidl","year":"2012","venue":"TAP 2012","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dequen and Dubois, 2006] G. Dequen and O. Dubois. An efficient approach to solving random k-sat problems. J. Au- tom. Reasoning, 37(4):261-276, 2006.","title":"An efficient approach to solving random k-sat problems","authors":"G Dequen, O Dubois","year":"2006","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Eiter and Gottlob, 1995] T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: Propositional case. AMAI, 15(3-4):289-323, 1995.","title":"On the computational cost of disjunctive logic programming: Propositional case","authors":"T Eiter, G Gottlob","year":"1995","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gebser et al., 2007] M. Gebser, B. Kaufmann, A. Neu- mann, and T. Schaub. clasp : A conflict-driven answer set solver. In LPNMR 2007, volume 4483 of LNCS, pages 260-265, 2007.","title":"clasp : A conflict-driven answer set solver","authors":"M Gebser, B Kaufmann, A Neumann, T Schaub","year":"2007","venue":"LPNMR 2007","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gent and Walsh, 1999] I. P. Gent and T. Walsh. Beyond NP: the QSAT phase transition. In AAAI, pages 648-653, 1999.","title":"Beyond NP: the QSAT phase transition","authors":"Walsh ; ] I P Gent, T Gent, Walsh","year":"1999","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Giráldez-Cru and Levy, 2016] J. Giráldez-Cru and J. Levy. Generating SAT instances with community structure. Ar- tif. Intell., 238:119-134, 2016.","title":"Generating SAT instances with community structure","authors":"Giráldez-Cru And Levy, ; ] J Giráldez-Cru, J Levy","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Heule et al., 2015] M. Heule, M. Järvisalo, F. Lonsing, M. Seidl, and A. Biere. Clause elimination for SAT and QSAT. J. Artif. Intell. Res. (JAIR), 53:127-168, 2015.","title":"Clause elimination for SAT and QSAT","authors":"M Heule, M Järvisalo, F Lonsing, M Seidl, A Biere","year":"2015","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Janota et al., 2016] M. Janota, W. Klieber, J. Marques- Silva, and E.M. Clarke. Solving QBF with counterexample guided refinement. Artif. Intell., 234:1-25, 2016.","title":"Solving QBF with counterexample guided refinement","authors":"M Janota, W Klieber, J Marques-Silva, E M Clarke","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Järvisalo et al., 2012] M. Järvisalo, D. Le Berre, O. Rous- sel, and L. Simon. The international SAT solver competi- tions. AI Magazine, 33(1), 2012.","title":"The international SAT solver competitions","authors":"M Järvisalo, D Le Berre, O Roussel, L Simon","year":"2012","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kautz and Selman, 2003] H. A. Kautz and B. Selman. Ten challenges redux: Recent progress in propositional reason- ing and search. In CP 2003, volume 2833 of LNCS, pages 1-18, 2003.","title":"Ten challenges redux: Recent progress in propositional reasoning and search","authors":"H A Kautz, B Selman","year":"2003","venue":"CP 2003","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Klieber et al., 2013] W. Klieber, M. Janota, J. Marques- Silva, and E. M. Clarke. Solving QBF with free variables. In CP 2013, volume 8124 of LNCS, pages 415-431, 2013.","title":"Solving QBF with free variables","authors":"W Klieber, M Janota, J Marques-Silva, E M Clarke","year":"2013","venue":"CP 2013","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Koch et al., 2003] C. Koch, N. Leone, and G. Pfeifer. En- hancing disjunctive logic programming systems by SAT checkers. Artif. Intell., 151(1-2):177-212, 2003.","title":"Enhancing disjunctive logic programming systems by SAT checkers","authors":"C Koch, N Leone, G Pfeifer","year":"2003","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Mitchell, 2002] D. G. Mitchell. Resolution complexity of random constraints. In CP 2002, volume 2470 of LNCS, pages 295-309, 2002.","title":"Resolution complexity of random constraints","authors":"D G Mitchell","year":"2002","venue":"CP 2002","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Namasivayam and Truszczynski, 2009] G. Namasivayam and M. Truszczynski. Simple random logic programs. In LPNMR 2009, volume 5753 of LNCS, pages 223-235, 2009.","title":"Simple random logic programs","authors":"G Namasivayam, M Truszczynski","year":"2009","venue":"LPNMR 2009","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Narizzano et al., 2006] M. Narizzano, L. Pulina, and A. Tacchella. Report of the third QBF solvers evaluation. JSAT, 2(1-4):145-164, 2006.","title":"Report of the third QBF solvers evaluation","authors":"M Narizzano, L Pulina, A Tacchella","year":"2006","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Navarro and Voronkov, 2005] J. Navarro and A. Voronkov. Generation of hard non-clausal random satisfiability prob- lems. In AAAI 2005, pages 436-442, 2005.","title":"Generation of hard non-clausal random satisfiability problems","authors":"J Navarro, A Voronkov","year":"2005","venue":"AAAI 2005","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Pigorsch and Scholl, 2010] F. Pigorsch and C. Scholl. An AIG-based QBF-solver using SAT for preprocessing. In DAC 2010, pages 170-175, 2010.","title":"An AIG-based QBF-solver using SAT for preprocessing","authors":"F Pigorsch, C Scholl","year":"2010","venue":"DAC 2010","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Selman et al., 1996] B. Selman, D. G. Mitchell, and H. J. Levesque. Generating hard satisfiability problems. Ar- tif. Intell., 81(1-2):17-29, 1996.","title":"Generating hard satisfiability problems","authors":"B Selman, D G Mitchell, H J Levesque","year":"1996","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wang et al., 2015] K. Wang, L. Wen, and K. Mu. Ran- dom logic programs: linear model. TPLP, 15(6):818-853, 2015.","title":"Random logic programs: linear model","authors":"K Wang, L Wen, K Mu","year":"2015","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Wen et al., 2016] L. Wen, K. Wang, Y. Shen, and F. Lin. A model for phase transition of random answer-set programs. ACM Trans. Comput. Log., 17(3):22, 2016.","title":"A model for phase transition of random answer-set programs","authors":"L Wen, K Wang, Y Shen, F Lin","year":"2016","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Zhao and Lin, 2003] Y. Zhao and F. Lin. Answer set pro- gramming phase transition: A study on randomly gener- ated programs. In ICLP 2003, volume 2916 of LNCS, pages 239-253, 2003.","title":"Answer set programming phase transition: A study on randomly generated programs","authors":"Y Zhao, F Lin","year":"2003","venue":"ICLP 2003","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}