{"type":"ScholarlyArticle","title":"Prime Implicate Generation in Equational Logic (extended abstract)","authors":[{"name":"Mnacho Echenim","slug":"mnacho-echenim","given":"Mnacho","family":"Echenim","affiliation":"CNRS , LIG , University of Grenoble Alpes , Grenoble , France"},{"name":"Nicolas Peltier","slug":"nicolas-peltier","given":"Nicolas","family":"Peltier","affiliation":"CNRS , LIG , University of Grenoble Alpes , Grenoble , France"},{"name":"Sophie Tourret","slug":"sophie-tourret","given":"Sophie","family":"Tourret","affiliation":"Max Planck Institute for Informatics , Saarbrücken ["}],"abstract":"A procedure is proposed to  efficiently generate sets of ground implicates of \r\nfirst-order formulas with equality. It is based on a tuning of the superposition\r\ncalculus, enriched with  rules \r\nthat add new hypotheses on demand during the proof search.\r\nExperimental results are presented, showing that the proposed\r\napproach is more efficient than state-of-the-art systems.","doi":"10.24963/ijcai.2018/790","url":"https://ijcai.org/proceedings/2018/790","pdf":"https://ijcai.org/proceedings/2018/0790.pdf","markdown":"https://ijcai.org/proceedings/2018/790.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/790","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Journal track","track":"Journal track","number":790,"pages":{"first":5588,"last":5592},"keywords":["Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving","Knowledge Representation and Reasoning: Diagnosis and Abductive Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Cruanes, 2014] Simon Cruanes. Logtk: a logic toolkit for automated reasoning and its implementation. In 4th Work- shop on Practical Aspects of Automated Reasoning., 2014.","title":"Logtk: a logic toolkit for automated reasoning and its implementation","authors":"Simon Cruanes, Cruanes","year":"2014","venue":"4th Work-shop on Practical Aspects of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[De Kleer, 1992] J. De Kleer. An improved incremental al- gorithm for generating prime implicates. In Proceedings of the National Conference on Artificial Intelligence, pages 780-780.","title":"An improved incremental algorithm for generating prime implicates","authors":"J De Kleer","year":null,"venue":"Proceedings of the National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Echenim et al., 2017] Mnacho Echenim, Nicolas Peltier, and Sophie Tourret. Prime Implicate Generation in Equa- tional Logic. Journal of Artificial Intelligence Research, 60:827-880, 2017.","title":"Mnacho Echenim, Nicolas Peltier, and Sophie Tourret. Prime Implicate Generation in Equational Logic","authors":"Echenim","year":"2017","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Iwanuma et al., 2009] Koji Iwanuma, Hidetomo Nabeshima, and Katsumi Inoue. Toward an efficient equality computation in connection tableaux: a mod- ification method without symmetry transformation-a preliminary report-. Proceedings of the international workshop on First-order Theorem Proving, 556:19, 2009.","title":"Toward an efficient equality computation in connection tableaux: a modification method without symmetry transformation-a preliminary report","authors":"Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue","year":"2009","venue":"Proceedings of the international workshop on First-order Theorem Proving","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Knill et al., 1993] E. Knill, P. T. Cox, and T. Pietrzykowski. Equality and abductive residua for Horn clauses. Theoret- ical Computer Science, 120(1):1-44, November 1993.","title":"Equality and abductive residua for Horn clauses","authors":"E Knill, P T Cox, T Pietrzykowski","year":"1993","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Marquis, 1991] P. Marquis. Extending abduction from propositional to first-order logic. In Proceedings of the International Workshop on Fundamentals of Artificial In- telligence Research, pages 141-155. Springer, 1991.","title":"Extending abduction from propositional to first-order logic","authors":"P Marquis","year":"1991","venue":"Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Marquis, 2000] Pierre Marquis. Consequence finding algo- rithms. In Handbook of Defeasible Reasoning and Un- certainty Management Systems, pages 41-145. Springer, 2000.","title":"Consequence finding algorithms","authors":"Pierre Marquis","year":"2000","venue":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Mayer and Pirri, 1993] Marta Cialdea Mayer and Fiora Pirri. First order abduction via tableau and sequent cal- culi. Logic Journal of the IGPL, 1(1):99-117, 1993.","title":"First order abduction via tableau and sequent calculi","authors":"Pirri Mayer, Marta Cialdea Mayer, Fiora Pirri","year":"1993","venue":"Logic Journal of the IGPL","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Nabeshima et al., 2010] Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, and Oliver Ray. SOLAR: an automated deduction system for consequence finding. AI Communications, 23(2):183-203, 2010.","title":"SOLAR: an automated deduction system for consequence finding","authors":"Nabeshima","year":"2010","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Nieuwenhuis and Rubio, 2001] Robert Nieuwenhuis and Albert Rubio. Paramodulation-based theorem proving. In John Alan Robinson and Andrei Voronkov, editors, Hand- book of Automated Reasoning, pages 371-443. Elsevier and MIT Press, 2001.","title":"Paramodulation-based theorem proving","authors":"Rubio Nieuwenhuis, Robert Nieuwenhuis, Albert Rubio","year":"2001","venue":"Handbook of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Previti et al., 2015] A. Previti, A. Ignatiev, A. Morgado, and J. Marques-Silva. Prime compilation of non-clausal for- mulae. In Proceedings of the 24th International Confer- ence on Artificial Intelligence, pages 1980-1987. AAAI Press, 2015.","title":"Prime compilation of non-clausal formulae","authors":"A Previti, A Ignatiev, A Morgado, J Marques-Silva","year":"2015","venue":"Proceedings of the 24th International Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/281"},{"position":12,"raw":"[Simon and Del Val, 2001] L. Simon and A. Del Val. Ef- ficient consequence finding. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 359-370, 2001.","title":"Efficient consequence finding","authors":"L Simon, A Del, Val","year":"2001","venue":"Proceedings of the 17th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2001/51"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}