An Approach to Abductive Reasoning in Equational Logic

Mnacho Echenim (1) , Nicolas Peltier (1) , Sophie Tourret (2)

1 CAPP - Calculs algorithmes programmes et preuves
2 LIG - Laboratoire d'Informatique de Grenoble

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.

Domaines: Logique en informatique [cs.LO]

Mnacho Echenim, Nicolas Peltier, Sophie Tourret. An Approach to Abductive Reasoning in Equational Logic. IJCAI 2013 - International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.531-537. ⟨hal-00934278⟩