An Evaluation Based Theorem Prover

DOI10.1109/TPAMI.1985.4767619MaRDI QIDQ3681965zbMATH OpenWikidataFDO

Authors Franco Sirovich, Pierpaolo Degano

Publication date 1985

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TPAMI.1985.4767619

zbMATH Keywords

inductionless proofsiterative functionssymbolic computationsymbolic evaluation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Evaluating general purpose automated theorem proving systems
• A theorem prover for a computational logic
• scientific article; zbMATH DE number 4164171
• scientific article; zbMATH DE number 4106292
• A circumscriptive theorem prover
• An Intuitionistic Predicate Logic Theorem Prover
• scientific article; zbMATH DE number 3965464
• Theorem proving based on the extension rule

Cited in

(3)

• Why Horn formulas matter in computer science: initial structures and generic examples
• Evaluating general purpose automated theorem proving systems
• Pierpaolo Degano

This page was built for publication: An Evaluation Based Theorem Prover

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