Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Experiments with proof plans for induction
Journal of Automated Reasoning
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The Karlsruhe Induction Theorem Proving System
Proceedings of the 8th International Conference on Automated Deduction
Argument-Bounded Algorithms as a Basis for Automated Termination Proofs
Proceedings of the 9th International Conference on Automated Deduction
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions
CL '00 Proceedings of the First International Conference on Computational Logic
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructing Induction Rules for Deductive Synthesis Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of automated deduction
Artificial intelligence today
European collaboration on automated reasoning
AI Communications - ECAI 2012 Turing and Anniversary Track
Hi-index | 0.00 |
The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...