Skip to main content
Conference Proceedings

Satallax: An automatic higher-order prover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7364 LNAI 111-117
DOI: 10.1007/978-3-642-31365-3_11
75Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Brown, C. E. (2012). Satallax: An automatic higher-order prover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7364 LNAI, pp. 111–117). https://doi.org/10.1007/978-3-642-31365-3_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free