An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
Intensional updates: abduction via deduction
Logic programming
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Database Updates through Abduction
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Minimal Answer Computation and SOL
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
How to Produce Information About a Given Entity Using Automated Deduction Methods
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
There are many new application fields for automated deduction where we have to apply abductive reasoning. In these applications we have to generate consequences of a given theory having some appropriate properties. In particular we consider the case where we have to generate the clauses containing instances of a given literal L. The negation of the other literals in such clauses are hypothesis allowing to derive L. In this paper we present an inference rule, called L-inference, which was designed in order to derive those clauses, and a L-strategy. The L-inference rule is a sort of Input Hyper-resolution. The main result of the paper is the proof of the soundness and completeness of the L-inference rule. The L-strategy associated to the L-inference rule, is a saturation by level with deletion of the tautologies and of the subsumed clauses. We show that the L-strategy is also complete.