{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:56Z","timestamp":1740123596419,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007109","name":"Universit\u00e0 degli Studi di Ferrara","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007109","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Abductive logic programming (ALP) extends logic programming with hypothetical reasoning by means of abducibles, an extension able to handle interesting problems, such as diagnosis, planning, and verification with formal methods. Implementations of this extension have been using Prolog meta-interpreters and Prolog programs with Constraint Handling Rules (). While the latter adds a clean and efficient interface to the host system, it still suffers in performance for large programs. Here, the concern is to obtain a more performant implementation of the  system following a compiled approach. This paper, as a first step in this long term goal, sets out a propositional ALP system following , eliminating the need for  and achieving better performance.<\/jats:p>","DOI":"10.1007\/s10462-024-10928-7","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T04:01:51Z","timestamp":1729137711000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient propositional system for Abductive Logic Programming"],"prefix":"10.1007","volume":"57","author":[{"given":"Marco","family":"Gavanelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascual","family":"Juli\u00e1n-Iranzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"S\u00e1enz-P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"10928_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-7908-1834-5_13","volume-title":"Flexible Query Answering Systems","author":"S Abdennadher","year":"2001","unstructured":"Abdennadher S, Christiansen H (2001) An experimental CLP platform for integrity constraints and abduction. In: Larsen HL, Andreasen T, Christiansen H, Kacprzyk J, Zadro\u017cny S (eds) Flexible Query Answering Systems. Physica-Verlag HD, Heidelberg, pp 141\u2013152"},{"issue":"4","key":"10928_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.3233\/FI-2013-839","volume":"124","author":"M Alberti","year":"2013","unstructured":"Alberti M, Gavanelli M, Lamma E (2013) The CHR-based Implementation of the SCIFF Abductive System. Fundam. Informaticae 124(4):365\u2013381. https:\/\/doi.org\/10.3233\/FI-2013-839","journal-title":"Fundam. Informaticae"},{"key":"10928_CR3","unstructured":"Alberti M, Gavanelli M, Chesani F (2022) The SCIFF Abductive Proof Procedure. System Implementation, available at http:\/\/lia.deis.unibo.it\/sciff\/"},{"issue":"3\u20134","key":"10928_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S1471068418000285","volume":"18","author":"J Arias","year":"2018","unstructured":"Arias J, Carro M, Salazar E, Marple K, Gupta G (2018) Constraint answer set programming without grounding. Theory and Practice of Logic Programming 18(3\u20134):337\u2013354","journal-title":"Theory and Practice of Logic Programming"},{"key":"10928_CR5","doi-asserted-by":"crossref","unstructured":"Calcagno C, Distefano D, O\u2019Hearn PW, Yang H (2011) Compositional shape analysis by means of bi-abduction. J. ACM 58(6)","DOI":"10.1145\/2049697.2049700"},{"issue":"4\u20135","key":"10928_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1017\/S1471068414000271","volume":"14","author":"L Caroprese","year":"2014","unstructured":"Caroprese L, Trubitsyna I, Truszczy\u0144ski M, Zumpano E (2014) A measure of arbitrariness in abductive explanations. Theory and Practice of Logic Programming 14(4\u20135):665\u2013679","journal-title":"Theory and Practice of Logic Programming"},{"issue":"6","key":"10928_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MIS.2022.3198337","volume":"37","author":"L Caroprese","year":"2022","unstructured":"Caroprese L, Zumpano E, Bogaerts B (2022) Computing abductive explanations. IEEE Intell. Syst. 37(6):18\u201326","journal-title":"IEEE Intell. Syst."},{"key":"10928_CR8","doi-asserted-by":"crossref","unstructured":"Chen Y, Su Z, (2015) Guided differential testing of certificate validation in SSL, TLS implementations. ESEC, FSE, (2015) Association for Computing Machinery. NY, USA, New York","DOI":"10.1145\/2786805.2786835"},{"key":"10928_CR9","doi-asserted-by":"crossref","unstructured":"Chen Y, Su T, Sun C, Su Z, Zhao J (2016) Coverage-directed differential testing of JVM implementations. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI\u20192016. Association for Computing Machinery, New York, NY, USA, pp 85\u201399","DOI":"10.1145\/2908080.2908095"},{"key":"10928_CR10","doi-asserted-by":"crossref","unstructured":"Christiansen H, Dahl V (2005) HYPROLOG: A new logic programming language with assumptions and abduction. In: Gabbrielli M, Gupta G (eds) Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2\u20135, 2005, Proceedings. Lecture Notes in Computer Science, vol 3668, pp 159\u2013173","DOI":"10.1007\/11562931_14"},{"key":"10928_CR11","unstructured":"Douven I (2021) Abduction. In: Zalta EN (ed) The Stanford Encyclopedia of Philosophy, Summer 2021 edition"},{"issue":"4","key":"10928_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S1471068409003780","volume":"9","author":"S Est\u00e9vez-Mart\u00edn","year":"2009","unstructured":"Est\u00e9vez-Mart\u00edn S, Fern\u00e1ndez AJ, S\u00e1enz-P\u00e9rez F, Hortal\u00e1-Gonz\u00e1lez T, Rodr\u00edguez-Artalejo M, Vado V\u00edrseda R (2009) On the Cooperation of the Constraint Domains $${\\cal{H} }$$, $${\\cal{R} }$$ and $${{\\cal{F} }}{{\\cal{D} }}$$ in $$CFLP$$. Theory and Practice of Logic Programming 9(4):415\u2013527","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"10928_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth T (1998) Theory and practice of constraint handling rules. The Journal of Logic Programming 37(1):95\u2013138","journal-title":"The Journal of Logic Programming"},{"issue":"2","key":"10928_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0743-1066(97)00026-5","volume":"33","author":"TH Fung","year":"1997","unstructured":"Fung TH, Kowalski R (1997) The IFF proof procedure for abductive logic programming. Journal of Logic Programming 33(2):151\u2013165. https:\/\/doi.org\/10.1016\/S0743-1066(97)00026-5","journal-title":"Journal of Logic Programming"},{"key":"10928_CR15","first-page":"25","volume-title":"2003 Joint Conference on Declarative Programming","author":"M Gavanelli","year":"2003","unstructured":"Gavanelli M, Lamma E, Mello P, Milano M (2003) Torroni P (2003) Interpreting abduction in CLP. In: Buccafurri F (ed) 2003 Joint Conference on Declarative Programming. AGP-2003, Reggio Calabria, Italy, September 3\u20135, pp 25\u201335"},{"key":"10928_CR16","unstructured":"Gavanelli M, Juli\u00e1n-Iranzo P, S\u00e1enz-P\u00e9rez F (2024) PIFFC and PTS Systems. https:\/\/www.fdi.ucm.es\/profesor\/fernan\/ALP\/PIFFCv3.zip"},{"issue":"5","key":"10928_CR17","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1017\/S1471068421000405","volume":"21","author":"P Juli\u00e1n-Iranzo","year":"2021","unstructured":"Juli\u00e1n-Iranzo P, S\u00e1enz-P\u00e9rez F (2021) Planning for an efficient implementation of hypothetical Bousi$$\\sim $$Prolog. Theory and Practice of Logic Programming 21(5):680\u2013697","journal-title":"Theory and Practice of Logic Programming"},{"key":"10928_CR18","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"AC Kakas","year":"1992","unstructured":"Kakas AC, Kowalski RA, Toni F (1992) Abductive logic programming. Journal of Logic and Computation 2:719\u2013770. https:\/\/doi.org\/10.1093\/logcom\/2.6.719","journal-title":"Journal of Logic and Computation"},{"key":"10928_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K Kunen","year":"1987","unstructured":"Kunen K (1987) Negation in logic programming. Journal of Logic Programming 4:289\u2013308","journal-title":"Journal of Logic Programming"},{"key":"10928_CR20","doi-asserted-by":"crossref","unstructured":"Le V, Afshari M, Su Z (2014) Compiler validation via equivalence modulo inputs. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI\u20192014. Association for Computing Machinery, New York, NY, USA, pp 216\u2013226","DOI":"10.1145\/2594291.2594334"},{"issue":"1","key":"10928_CR21","first-page":"100","volume":"10","author":"WM McKeeman","year":"1998","unstructured":"McKeeman WM (1998) Differential testing for software. Digit. Tech. J. 10(1):100\u2013107","journal-title":"Digit. Tech. J."},{"key":"10928_CR22","unstructured":"Peirce CS (1965) Collected Papers of Charles Sanders Peirce [CP]. Editors Ch. Hartshorne and P. Weiss"},{"key":"10928_CR23","doi-asserted-by":"publisher","unstructured":"Petsios T, Tang A, Stolfo S, Keromytis AD, Jana S (2017) Nezha: Efficient domain-independent differential testing. In: 38th IEEE Symposium on Security and Privacy (SP), pp 615\u2013632. https:\/\/doi.org\/10.1109\/SP.2017.27","DOI":"10.1109\/SP.2017.27"},{"key":"10928_CR24","unstructured":"Wielemaker J (2022) SWI-Prolog. Backtrackable assert. https:\/\/www.swi-prolog.org\/pldoc\/man?predicate=undo\/1"},{"issue":"1\u20132","key":"10928_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker J, Schrijvers T, Triska M, Lager T (2012) SWI-Prolog. Theory and Practice of Logic Programming 12(1\u20132):67\u201396","journal-title":"Theory and Practice of Logic Programming"},{"key":"10928_CR26","doi-asserted-by":"crossref","unstructured":"Yang X, Chen Y, Eide E, Regehr J, (2011) Finding and Understanding Bugs in C Compilers. ACM SIGPLAN PLDI, (2011) PLDI\u20192011. ACM, New York, NY, USA, pp 283\u2013294","DOI":"10.1145\/1993498.1993532"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-024-10928-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-024-10928-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-024-10928-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T10:20:02Z","timestamp":1731493202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-024-10928-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":26,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["10928"],"URL":"https:\/\/doi.org\/10.1007\/s10462-024-10928-7","relation":{},"ISSN":["1573-7462"],"issn-type":[{"type":"electronic","value":"1573-7462"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"22 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial and proprietary interests"}}],"article-number":"334"}}