FLOTTER
From MaRDI portal
Cited in
(19)- Labelled splitting
- Automated verification of refinement laws
- An optimality result for clause form translation
- On the modelling of search in theorem proving -- towards a theory of strategy analysis
- Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
- Deciding the E^+-class by an a posteriori, liftable order
- SPASS
- Cancellative Abelian monoids and related structures in refutational theorem proving. II
- Deciding the guarded fragments by resolution
- A note on assumptions about Skolem functions
- Effective normalization techniques for HOL
- Saturate
- METEOR
- KoMeT
- Reasoning without believing: on the mechanisation of presuppositions and partiality
- From search to computation: redundancy criteria and simplification at work
- scientific article; zbMATH DE number 7178359 (Why is no real title available?)
- Integration of automated and interactive theorem proving in ILF
- Soft typing for ordered resolution
This page was built for software: FLOTTER
