ML Anthology

An Approach to Abductive Reasoning in Equational Logic

Mnacho Echenim, Nicolas Peltier, Sophie Tourret
IJCAI 2013 pp. 531-537
/ijcai/2013/echenim2013ijcai-approach/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Echenim et al. "An Approach to Abductive Reasoning in Equational Logic." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Echenim et al. "An Approach to Abductive Reasoning in Equational Logic." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/echenim2013ijcai-approach/)

BibTeX

@inproceedings{echenim2013ijcai-approach,
  title     = {{An Approach to Abductive Reasoning in Equational Logic}},
  author    = {Echenim, Mnacho and Peltier, Nicolas and Tourret, Sophie},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {531-537},
  url       = {https://mlanthology.org/ijcai/2013/echenim2013ijcai-approach/}
}