{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:09Z","timestamp":1747173669396,"version":"3.40.5"},"reference-count":68,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The decoupling between the representation of a certain problem, that is, its knowledge model, and the reasoning side is one of main strong points of model-based artificial intelligence (AI). This allows, for example, to focus on improving the reasoning side by having advantages on the whole solving process. Further, it is also well known that many solvers are very sensitive to even syntactic changes in the input. In this paper, we focus on improving the reasoning side by taking advantages of such sensitivity. We consider two well-known model-based AI methodologies, SAT and ASP, define a number of syntactic features that may characterise their inputs, and use automated configuration tools to reformulate the input formula or program. Results of a wide experimental analysis involving SAT and ASP domains, taken from respective competitions, show the different advantages that can be obtained by using input reformulation and configuration.<\/jats:p>","DOI":"10.1017\/s1471068422000096","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T09:34:01Z","timestamp":1647855241000},"page":"415-443","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["On the Configuration of More and Less Expressive Logic Programs"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"MARCO","family":"MARATEA","sequence":"additional","affiliation":[]},{"given":"MAURO","family":"VALLATI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"key":"S1471068422000096_ref36","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000210"},{"key":"S1471068422000096_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"S1471068422000096_ref39","doi-asserted-by":"crossref","unstructured":"Hutter, F. , Hoos, H. H. and Leyton-Brown, K. 2011. Sequential model-based optimization for general algorithm configuration. In Learning and Intelligent Optimization - 5th International Conference, LION 5, Rome, Italy, 17\u201321 January 2011. Selected Papers, C. A. C. Coello, Ed. Lecture Notes in Computer Science, vol. 6683. Springer, 507\u2013523.","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"S1471068422000096_ref13","doi-asserted-by":"publisher","DOI":"10.3233\/IA-170104"},{"key":"S1471068422000096_ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9051-2"},{"key":"S1471068422000096_ref63","unstructured":"Vallati, M. and Serina, I. 2018. A general approach for configuring PDDL problem models. In Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, 24\u201329 June 2018, M. de Weerdt, S. Koenig, G. R\u00f6ger and M. T. J. Spaan, Eds. AAAI Press, 431\u2013436."},{"key":"S1471068422000096_ref62","doi-asserted-by":"crossref","unstructured":"Vallati, M. and Maratea, M. 2019. On the configuration of SAT formulae. In AI*IA 2019 - Advances in Artificial Intelligence - XVIIIth International Conference of the Italian Association for Artificial Intelligence, Rende, Italy, 19\u201322 November 2019, Proceedings, M. Alviano, G. Greco and F. Scarcello, Eds. Lecture Notes in Computer Science, vol. 11946. Springer, 264\u2013277.","DOI":"10.1007\/978-3-030-35166-3_19"},{"key":"S1471068422000096_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"S1471068422000096_ref33","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190120"},{"key":"S1471068422000096_ref7","unstructured":"Biere, A. 2017. Cadical, lingeling, plingeling, treengeling and yalsat entering the SAT competition 2017. In SAT Competition 2017, Solver and Benchmark Descriptions."},{"key":"S1471068422000096_ref65","unstructured":"Xu, L. , Hoos, H. H. and Leyton-Brown, K. 2010. Hydra: Automatically configuring algorithms for portfolio-based selection. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, 11\u201315 July 2010, M. Fox and D. Poole, Eds. AAAI Press."},{"key":"S1471068422000096_ref64","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000332"},{"key":"S1471068422000096_ref59","unstructured":"Syrj\u00e4nen, T. 2002. Lparse 1.0 user\u2019s manual."},{"key":"S1471068422000096_ref29","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, 15\u201319 August 1988 (2 Volumes), R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070\u20131080."},{"key":"S1471068422000096_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068422000096_ref23","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Schaub, T. , Schneider, M. T. and Ziller, S. 2011. A portfolio solver for answer set programming: Preliminary report. In Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, 16\u201319 May 2011. Proceedings, J. P. Delgrande and W. Faber, Eds. Lecture Notes in Computer Science, vol. 6645. Springer, 352\u2013357.","DOI":"10.1007\/978-3-642-20895-9_40"},{"key":"S1471068422000096_ref25","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5373"},{"key":"S1471068422000096_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000186"},{"key":"S1471068422000096_ref34","doi-asserted-by":"crossref","unstructured":"Hippen, N. and Lierler, Y. 2019. Automatic program rewriting in non-ground answer set programs. In Practical Aspects of Declarative Languages - 21th International Symposium, PADL 2019, Lisbon, Portugal, 14\u201315 January 2019, Proceedings, J. J. Alferes and M. Johansson, Eds. Lecture Notes in Computer Science, vol. 11372. Springer, 19\u201336.","DOI":"10.1007\/978-3-030-05998-9_2"},{"key":"S1471068422000096_ref51","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4726"},{"key":"S1471068422000096_ref54","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000094"},{"key":"S1471068422000096_ref56","doi-asserted-by":"crossref","unstructured":"Maratea, M. , Pulina, L. and Ricca, F. 2015b. Multi-level algorithm selection for ASP. In Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, 27\u201330 September 2015. Proceedings, F. Calimeri, G. Ianni and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 9345. Springer, 439\u2013445.","DOI":"10.1007\/978-3-319-23264-5_36"},{"key":"S1471068422000096_ref57","first-page":"112","article-title":"A SAT solver primer","volume":"85","author":"Mitchell","year":"2005","journal-title":"Bulletin of the EATCS"},{"key":"S1471068422000096_ref41","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2861"},{"key":"S1471068422000096_ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.05.004"},{"key":"S1471068422000096_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001765"},{"key":"S1471068422000096_ref48","doi-asserted-by":"crossref","unstructured":"KhudaBukhsh, A. R. , Xu, L. , Hoos, H. H. and Leyton-Brown, K. 2016. Satenstein: Automatically building local search SAT solvers from components. Artificial Intelligence 232, 20\u201342.","DOI":"10.1016\/j.artint.2015.11.002"},{"key":"S1471068422000096_ref24","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaufmann, B. and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 52\u201389.","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S1471068422000096_ref8","volume-title":"Frontiers in Artificial Intelligence and Applications","volume":"185","author":"Biere","year":"2009"},{"key":"S1471068422000096_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000105"},{"key":"S1471068422000096_ref4","doi-asserted-by":"crossref","unstructured":"Audemard, G. , Lagniez, J. and Simon, L. 2013. Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction. In Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, 8\u201312 July 2013. Proceedings, J\u00e4rvisalo, M. and Gelder, A. V. , Eds. Lecture Notes in Computer Science, vol. 7962. Springer, 309\u2013317.","DOI":"10.1007\/978-3-642-39071-5_23"},{"key":"S1471068422000096_ref28","doi-asserted-by":"crossref","unstructured":"Geffner, H. 2018. Model-free, model-based, and general intelligence. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, 13\u201319 July 2018, Stockholm, Sweden, J. Lang, Ed. ijcai.org, 10\u201317.","DOI":"10.24963\/ijcai.2018\/2"},{"key":"S1471068422000096_ref42","doi-asserted-by":"crossref","unstructured":"Hutter, F. , Lindauer, M. , Balint, A. , Bayless, S. , Hoos, H. H. and Leyton-Brown, K. 2017. The configurable SAT solver challenge (CSSC). Artificial Intelligence 243, 1\u201325.","DOI":"10.1016\/j.artint.2016.09.006"},{"key":"S1471068422000096_ref30","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3\/4, 365\u2013386.","DOI":"10.1007\/BF03037169"},{"key":"S1471068422000096_ref1","volume-title":"Computer Science","volume":"10377","author":"Alviano","year":"2017"},{"key":"S1471068422000096_ref17","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11420"},{"key":"S1471068422000096_ref49","unstructured":"Kilby, P. , Slaney, J. K. , Thi\u00e9baux, S. and Walsh, T. 2005. Backbones and backdoors in satisfiability. In Proceedings of the Twentieth National Conference on Artificial Intelligence, AAAI 2005, Veloso, M. M. and Kambhampati, S. , Eds. AAAI Press\/The MIT Press, 1368\u20131373."},{"key":"S1471068422000096_ref40","unstructured":"Hutter, F. , Hoos, H. H. and Leyton-Brown, K. 2014. An efficient approach for assessing hyperparameter importance. In Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21\u201326 June 2014. JMLR Workshop and Conference Proceedings, vol. 32. JMLR.org, 754\u2013762."},{"key":"S1471068422000096_ref6","doi-asserted-by":"crossref","unstructured":"Biedenkapp, A. , Marben, J. , Lindauer, M. and Hutter, F. 2018. CAVE: Configuration assessment, visualization and evaluation. In Learning and Intelligent Optimization - 12th International Conference, LION. 115\u2013130.","DOI":"10.1007\/978-3-030-05348-2_10"},{"key":"S1471068422000096_ref16","doi-asserted-by":"crossref","unstructured":"Dingess, M. and Truszczynski, M. 2020. Automated aggregator - rewriting with the counting aggregate. In Proceedings 36th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2020, (Technical Communications) UNICAL, Rende (CS), Italy, 18\u201324 September 2020, F. Ricca, A. Russo, S. Greco, N. Leone, A. Artikis, G. Friedrich, P. Fodor, A. Kimmig, F. A. Lisi, M. Maratea, A. Mileo and F. Riguzzi, Eds. EPTCS, vol. 325, 96\u2013109.","DOI":"10.4204\/EPTCS.325.0"},{"key":"S1471068422000096_ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"S1471068422000096_ref37","doi-asserted-by":"crossref","unstructured":"Hurley, B. , Kotthoff, L. , Malitsky, Y. , Mehta, D. and O\u2019Sullivan, B. 2016. Advanced portfolio techniques. In Data Mining and Constraint Programming - Foundations of a Cross-Disciplinary Approach. Springer, 191\u2013225.","DOI":"10.1007\/978-3-319-50137-6_8"},{"key":"S1471068422000096_ref20","doi-asserted-by":"crossref","unstructured":"Falkner, S. , Lindauer, M. and Hutter, F. 2015. Spysmac: Automated configuration and performance analysis of SAT solvers. In Theory and Applications of Satisfiability Testing - SAT 2015, 215\u2013222.","DOI":"10.1007\/978-3-319-24318-4_16"},{"key":"S1471068422000096_ref44","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.16.35-86"},{"key":"S1471068422000096_ref68","unstructured":"Yuan, Z. , St\u00fctzle, T. and Birattari, M. 2010. Mads\/f-race: Mesh adaptive direct search meets f-race. In Trends in Applied Intelligent Systems - 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA\/AIE 2010, Cordoba, Spain, 1\u20134 June 2010, Proceedings, Part I, N. Garc\u00eda-Pedrajas, F. Herrera, C. Fyfe, J. M. Ben\u00edtez and M. Ali, Eds. Lecture Notes in Computer Science, vol. 6096. Springer, 41\u201350."},{"key":"S1471068422000096_ref46","unstructured":"Kadioglu, S. , Malitsky, Y. , Sellmann, M. and Tierney, K. 2010a. ISAC - instance-specific algorithm configuration. In ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, 16\u201320 August 2010, Proceedings, H. Coelho, R. Studer and M. J. Wooldridge, Eds. Frontiers in Artificial Intelligence and Applications, vol. 215. IOS Press, 751\u2013756."},{"key":"S1471068422000096_ref2","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Dodaro, C. , Leone, N. and Ricca, F. 2015. Advances in WASP. In Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, 27\u201330 September 2015. Proceedings, Calimeri, F. , Ianni, G. and Truszczynski, M. , Eds. Lecture Notes in Computer Science, vol. 9345. Springer, 40\u201354.","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"S1471068422000096_ref53","unstructured":"Maratea, M. , Pulina, L. and Ricca, F. 2013. Automated selection of grounding algorithm in answer set programming. In AI*IA 2013: Advances in Artificial Intelligence - XIIIth International Conference of the Italian Association for Artificial Intelligence, Turin, Italy, 4\u20136 December 2013. Proceedings, M. Baldoni, C. Baroglio, G. Boella and R. Micalizio, Eds. Lecture Notes in Computer Science, vol. 8249. Springer, 73\u201384."},{"key":"S1471068422000096_ref22","unstructured":"Fitzgerald, T. , Malitsky, Y. and O\u2019Sullivan, B. 2015. Reactr: Realtime algorithm configuration through tournament rankings. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, Q. Yang and M. J. Wooldridge, Eds. AAAI Press, 304\u2013310."},{"key":"S1471068422000096_ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9191-0"},{"key":"S1471068422000096_ref67","doi-asserted-by":"crossref","unstructured":"Xu, L. , Hutter, F. , Hoos, H. H. and Leyton-Brown, K. 2012. Evaluating component solver contributions to portfolio-based algorithm selectors. In Theory and Applications of Satisfiability Testing - SAT 2012, 228\u2013241.","DOI":"10.1007\/978-3-642-31612-8_18"},{"key":"S1471068422000096_ref3","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C. , Sellmann, M. and Tierney, K. 2009. A gender-based genetic algorithm for the automatic configuration of algorithms. In Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, 20\u201324 September 2009, Proceedings, I. P. Gent, Ed. Notes, Lecture in Computer Science, vol. 5732. Springer, 142\u2013157.","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"S1471068422000096_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2017.10.002"},{"key":"S1471068422000096_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000015"},{"key":"S1471068422000096_ref47","unstructured":"Kadioglu, S. , Malitsky, Y. , Sellmann, M. and Tierney, K. 2010b. Isac-instance-specific algorithm configuration. In Proceedings of the European Conference on AI, vol. 215, 751\u2013756."},{"key":"S1471068422000096_ref66","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"S1471068422000096_ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2480759.2480767"},{"key":"S1471068422000096_ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000061"},{"key":"S1471068422000096_ref55","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/ext068"},{"key":"S1471068422000096_ref31","doi-asserted-by":"crossref","unstructured":"Gomes, C. P. , Selman, B. , Crato, N. and Kautz, H. A. 2000. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24, 1\/2, 67\u2013100.","DOI":"10.1023\/A:1006314320276"},{"key":"S1471068422000096_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068422000096_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000546"},{"key":"S1471068422000096_ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-021-09592-1"},{"key":"S1471068422000096_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"S1471068422000096_ref50","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068422000096_ref61","unstructured":"Vallati, M. , Hutter, F. , Chrpa, L. and McCluskey, T. L. 2015. On the effective configuration of planning domain models. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, Q. Yang and M. J. Wooldridge, Eds. AAAI Press, 1704\u20131711."},{"key":"S1471068422000096_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-018-0529-9"},{"key":"S1471068422000096_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.002"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068422000096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T23:38:26Z","timestamp":1680478706000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068422000096\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["S1471068422000096"],"URL":"https:\/\/doi.org\/10.1017\/s1471068422000096","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}