The following pages link to SPASS (Q16295):
Displayed 50 items.
- Subsumption demodulation in first-order theorem proving (Q2096454) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- A posthumous contribution by Larry Wos: excerpts from an unpublished column (Q2102925) (← links)
- Local is best: efficient reductions to modal logic \textsf{K} (Q2102930) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL (Q2104508) (← links)
- SCL(EQ): SCL for first-order logic with equality (Q2104511) (← links)
- Local reductions for the modal cube (Q2104538) (← links)
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving (Q2128804) (← links)
- AC simplifications and closure redundancies in the superposition calculus (Q2142076) (← links)
- Herbrand constructivization for automated intuitionistic theorem proving (Q2180528) (← links)
- Introducing \(H\), an institution-based formal specification and verification language (Q2183716) (← links)
- Institution-based encoding and verification of simple UML state machines in CASL/SPASS (Q2237342) (← links)
- Automating free logic in HOL, with an experimental application in category theory (Q2303232) (← links)
- A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- Combining induction and saturation-based theorem proving (Q2303240) (← links)
- SPASS-AR: a first-order theorem prover based on approximation-refinement into the monadic shallow linear fragment (Q2303255) (← links)
- SPASS-SATT. A CDCL(LA) solver (Q2305409) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
- Semantics of Mizar as an Isabelle object logic (Q2323445) (← links)
- Unification with abstraction and theory instantiation in saturation-based reasoning (Q2324203) (← links)
- A subset-matching size-bounded cache for testing satisfiability in modal logics (Q2349812) (← links)
- SMELS: satisfiability modulo equality with lazy superposition (Q2351265) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- Premise selection for mathematics by corpus analysis and kernel methods (Q2352489) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Automated generation of machine verifiable and readable proofs: a case study of Tarski's geometry (Q2354917) (← links)
- The model evolution calculus as a first-order DPLL method (Q2389629) (← links)
- Proof planning with multiple strategies (Q2389631) (← links)
- Commonsense reasoning about containers using radically incomplete information (Q2407460) (← links)
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models (Q2423750) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- Automated deduction -- CADE-21. 21st international conference on automated deduction, Bremen, Germany, July 17--20, 2007. Proceedings (Q2461168) (← links)
- Assumption propagation through annotated programs (Q2628303) (← links)
- From informal to formal proofs in Euclidean geometry (Q2631958) (← links)
- Crystal: Integrating structured queries into a tactic language (Q2655333) (← links)
- Theorem proving using clausal resolution: from past to present (Q2695485) (← links)
- (Q2702602) (← links)
- (Q2702605) (← links)
- (Q2767011) (← links)
- (Q2767012) (← links)
- (Q2767917) (← links)
- Resolution in Modal, Description and Hybrid Logic (Q2772883) (← links)
- Schematic Cut Elimination and the Ordered Pigeonhole Principle (Q2817924) (← links)
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (Q2817933) (← links)
- Effective Normalization Techniques for HOL (Q2817937) (← links)