Extending decision procedures with induction schemes

DOI10.1007/10721959_26MaRDI QIDQ2723430zbMATH OpenFDO

Authors Deepak Kapur, Mahadevan Subramaniam

Publication date 5 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721959_26

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Recommendations

• Rewriting, induction and decision procedures: A case study of Presburger arithmetic
• Incorporating decision procedures in implicit induction.
• Inductive Decidability Using Implicit Induction
• Rewriting Induction + Linear Arithmetic = Decision Procedure
• Decidable classes of inductive theorems

Cited in

(10)

• Rewriting, induction and decision procedures: A case study of Presburger arithmetic
• scientific article; zbMATH DE number 2177631 (Why is no real title available?)
• scientific article; zbMATH DE number 3986670 (Why is no real title available?)
• Decidable classes of inductive theorems
• An abstract decision procedure for a theory of inductive data types.
• Inductive Decidability Using Implicit Induction
• Inductive Logic Programming
• A tableaux-based decision procedure for multi-parameter propositional schemata
• A decidable class of nested iterated schemata
• Deciding inductive validity of equations.

Describes a project that uses

Uses Software

• RRL

This page was built for publication: Extending decision procedures with induction schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723430)