Satallax

Satallax is an automated theorem prover for higher-order logic. The particular form of higher-order logic supported by Satallax is Church’s simple type theory with extensionality and choice operators. The SAT solver MiniSat is responsible for much of the search for a proof. Satallax generates propositional clauses corresponding to rules of a complete tableau calculus and calls MiniSat periodically to test satisfiability of these clauses. Satallax is implemented in Objective Caml. You can run Satallax online at the System On TPTP website.


References in zbMATH (referenced in 30 articles , 2 standard articles )

Showing results 1 to 20 of 30.
Sorted by year (citations)

1 2 next

  1. Slaney, John; Woltzenlogel Paleo, Bruno: Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning (2018)
  2. Benzmüller, Christoph: Cut-elimination for quantified conditional logic (2017)
  3. Benzmüller, C.; Weber, Leon; Woltzenlogel Paleo, Bruno: Computer-assisted analysis of the Anderson-Hájek ontological controversy (2017)
  4. Färber, Michael; Kaliszyk, Cezary; Urban, Josef: Monte Carlo tableau proof search (2017)
  5. Blanchette, Jasmin Christian; Böhme, Sascha; Fleury, Mathias; Smolka, Steffen Juilf; Steckermeier, Albert: Semi-intelligible Isar proofs from machine-generated proofs (2016)
  6. Brown, Chad E.; Urban, Josef: Extracting higher-order goals from the Mizar Mathematical Library (2016)
  7. Färber, Michael; Brown, Chad: Internal guidance for Satallax (2016)
  8. Steen, Alexander; Benzmüller, Christoph: Sweet SIXTEEN: automation via embedding into classical higher-order logic (2016)
  9. Steen, Alexander; Wisniewski, Max; Benzmüller, Christoph: Agent-based HOL reasoning (2016)
  10. Wisniewski, Max; Steen, Alexander; Kern, Kim; Benzmüller, Christoph: Effective normalization techniques for HOL (2016)
  11. Benzmüller, Christoph: Invited talk: on a (quite) universal theorem proving approach and its application in metaphysics (2015)
  12. Benzmüller, Christoph; Paleo, Bruno Woltzenlogel: Interacting with modal logics in the coq proof assistant (2015)
  13. Benzmüller, Christoph; Sultana, Nik; Paulson, Lawrence C.; Theiß, Frank: The higher-order prover Leo-II (2015)
  14. Kühlwein, Daniel; Urban, Josef: MaLeS: a framework for automatic tuning of automated theorem provers (2015)
  15. Sultana, Nik; Benzmüller, Christoph; Paulson, Lawrence C.: Proofs and reconstructions (2015)
  16. Wisniewski, Max; Steen, Alexander; Benzmüller, Christoph: LeoPARD -- a generic platform for the implementation of higher-order reasoners (2015)
  17. Kaliszyk, Cezary; Urban, Josef: Learning-assisted automated reasoning with $\mathsfFlyspeck$ (2014)
  18. Benzmüller, Christoph; Raths, Thomas: HOL based first-order modal logic provers (2013)
  19. Brown, Chad E.: Reducing higher-order theorem proving to a sequence of SAT problems (2013)
  20. Sultana, Nik; Blanchette, Jasmin Christian; Paulson, Lawrence C.: LEO-II and Satallax on the Sledgehammer test bench (2013)

1 2 next