SRASS - A Semantic Relevance Axiom Selection System

DOI10.1007/978-3-540-73595-3_20MaRDI QIDQ3608780zbMATH OpenOpenAlexFDO

Authors Yury Puzis, Geoff Sutcliffe

Publication date 6 March 2009

Published in Automated Deduction – CADE-21 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73595-3_20

Mathematics Subject Classification ID

Recommendations

• Premise selection in the Naproche system
• scientific article; zbMATH DE number 6423829
• Sine qua non for large theory reasoning
• RETRPROV. A system that looks for axioms
• A relevance restriction strategy for automated deduction

Cited in

(15)

• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• scientific article; zbMATH DE number 1954191 (Why is no real title available?)
• Lakatos-style collaborative mathematics through dialectical, structured and abstract argumentation
• Automated verification of refinement laws
• SRASS
• Premise selection in the Naproche system
• System description: E.T. 0.1
• Sine qua non for large theory reasoning
• Theorem proving in large formal mathematics as an emerging AI field
• Lemmatization for stronger reasoning in large theories
• Learning-assisted theorem proving with millions of lemmas
• Names are not just sound and smoke: word embeddings for axiom selection
• History and prospects for first-order automated deduction
• Automated Reasoning for Hybrid Systems — Two Case Studies —
• MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance

Describes a project that uses

Uses Software

• SystemOnTPTP
• E Theorem Prover
• OTTER

This page was built for publication: SRASS - A Semantic Relevance Axiom Selection System

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