Journal of Symbolic Computation
Predicate synthesis from formal specifications
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
Term rewriting and all that
A Mechanizable Induction Principle for Equational Specifications
Proceedings of the 9th International Conference on Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Extending Decision Procedures with Induction Schemes
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Simplification Orderings: History Of Results
Fundamenta Informaticae
A Rewrite Rule Based Framework for Combining Decision Procedures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
ACM Computing Surveys (CSUR)
Decidability and undecidability results for propositional schemata
Journal of Artificial Intelligence Research
Inductive decidability using implicit induction
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning on schemata of formulæ
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Rewriting induction + linear arithmetic = decision procedure
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Kapur and Subramaniam [8] defined syntactical classes of equations where inductive validity is decidable. Thus, their validity can be checked without any user interaction and hence, this allows an integration of (a restricted form of) induction in fully automated reasoning tools such as model checkers. However, the results of [8] were only restricted to equations. This paper extends the classes of conjectures considered in [8] to a larger class of arbitrary quantifier-free formulas (e.g., conjectures also containing negation, conjunction, disjunction, etc.).