Satallax: an automatic higher-order prover

Authors:
Chad E. Brown
Affiliations:
Saarland University, Saarbrücken, Germany
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 8
Cited 3

Solving for Set Variables in Higher-Order Theorem Proving

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
Satisfiability modulo theories: introduction and applications

Communications of the ACM
Extending Sledgehammer with SMT solvers

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Reducing higher-order theorem proving to a sequence of SAT problems

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Analytic Tableaux for Higher-Order Logic with Choice

Journal of Automated Reasoning
The CADE-23 Automated Theorem Proving System Competition - CASC-23

AI Communications

MaSh: machine learning for sledgehammer

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Automating quantified conditional logics in HOL

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Theorem proving in large formal mathematics as an emerging AI field

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Satallax is an automatic higher-order theorem prover that generates propositional clauses encoding (ground) tableau rules and uses MiniSat to test for unsatisfiability. We describe the implementation, focusing on flags that control search and examples that illustrate how the search proceeds.