Artificial Intelligence
Equational problems anddisunification
Journal of Symbolic Computation
SPIKE, an Automatic Theorem Prover
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Parametric Circuit Representation Using Inductive Boolean Functions
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Handbook of automated reasoning
Handbook of automated reasoning
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Rippling: meta-level guidance for mathematical reasoning
Rippling: meta-level guidance for mathematical reasoning
Some Techniques for Proving Termination of the Hyperresolution Calculus
Journal of Automated Reasoning
CERES: An analysis of Fürstenberg's proof of the infinity of primes
Theoretical Computer Science
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Deciding the inductive validity of ∀∃* queries
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidability and undecidability results for propositional schemata
Journal of Artificial Intelligence Research
Linear Temporal Logic and Propositional Schemata, Back and Forth
TIME '11 Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning
Focused inductive theorem proving
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
We define a proof procedure that allows for a limited form of inductive reasoning. The first argument of a function symbol is allowed to belong to an inductive type. We will call such an argument an index. We enhance the standard superposition calculus with a loop detection rule, in order to encode a particular form of mathematical induction. The satisfiability problem is not semi-decidable, but some classes of clause sets are identified for which the proposed procedure is complete and/or terminating.