An approach to abductive reasoning in equational logic

Authors:
M. Echenim;N. Peltier;S. Tourret
Affiliations:
University of Grenoble, CNRS, Grenoble INP, LIG;University of Grenoble, CNRS, Grenoble INP, LIG;University of Grenoble, CNRS, Grenoble INP, LIG
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 15
Cited 0

Implication of clauses is undecidable

Theoretical Computer Science
An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
The resolution calculus

The resolution calculus
Trie memory

Communications of the ACM
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
Extending abduction from propositional to first-order logic

FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Computing Prime Implicates Incrementally

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Handbook of automated reasoning

Handbook of automated reasoning
Resolution decision procedures

Handbook of automated reasoning
Prediction is deduction but explanation is abduction

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Efficient consequence finding

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Prime Implicate Tries

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Found ations of assumption-based truth maintenance systems: preliminary report

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
An improved incremental algorithm for generating prime implicates

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A calculus for generating ground explanations

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.