CSC '92 Proceedings of the 1992 ACM annual conference on Communications
The complexity of logic-based abduction
Journal of the ACM (JACM)
The resolution calculus
Term rewriting and all that
Extending abduction from propositional to first-order logic
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
On Variable-inactivity and Polynomial T-Satisfiability Procedures
Journal of Logic and Computation
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Theory decision by decomposition
Journal of Symbolic Computation
Combination of convex theories: Modularity, deduction completeness, and explanation
Journal of Symbolic Computation
An approach to abductive reasoning in equational logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We present a modification of the superposition calculus that is meant to generate explanations why a set of clauses is satisfiable. This process is related to abductive reasoning, and the explanations generated are clauses constructed over so-called abductive constants. We prove the correctness and completeness of the calculus in the presence of redundancy elimination rules, and develop a sufficient condition guaranteeing its termination; this sufficient condition is then used to prove that all possible explanations can be generated in finite time for several classes of clause sets, including many of interest to the SMT community. We propose a procedure that generates a set of explanations that should be useful to a human user and conclude by suggesting several extensions to this novel approach.