{"type":"ScholarlyArticle","title":"An Approach to Abductive Reasoning in Equational Logic","authors":[{"name":"Mnacho Echenim","slug":"mnacho-echenim","given":"Mnacho","family":"Echenim","affiliation":""},{"name":"Nicolas Peltier","slug":"nicolas-peltier","given":"Nicolas","family":"Peltier","affiliation":""},{"name":"Sophie Tourret","slug":"sophie-tourret","given":"Sophie","family":"Tourret","affiliation":""}],"abstract":"Abduction has been extensively studied in propositional logic because of its many applications in artificial intelligence. However, its intrinsic complexity has been a limitation to the implementation of abductive reasoning tools in more expressive logics. We have devised such a tool in ground flat equational logic, in which literals are equations or disequations between constants. Our tool is based on the computation of prime implicates. It uses a relaxed paramodulation calculus, designed to generate all prime implicates of a formula, together with a carefully defined data structure storing the implicates and able to efficiently detect, and remove, redundancies. In addition to a detailed description of this method, we present an analysis of some experimental results.","doi":null,"url":"https://ijcai.org/proceedings/2013/86","pdf":"https://ijcai.org/proceedings/2013/0086.pdf","markdown":"https://ijcai.org/proceedings/2013/86.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/86","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":86,"pages":{"first":531,"last":536},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}