SPASS automated theorem prover

E1023684

SPASS automated theorem prover is a first-order logic theorem proving system known for its use of superposition calculus and its application in automated reasoning and formal verification.

Try in SPARQL Jump to: Surface forms Statements Referenced by

Observed surface forms (1)

Surface form Occurrences
SPASS 0

Statements (49)

Predicate Object
instanceOf automated theorem prover
first-order logic theorem prover
software system
superposition-based theorem prover
applicationDomain automated reasoning
formal verification
knowledge representation and reasoning
mathematical logic
basedOn superposition calculus
feature output of formal proofs
refutational completeness for first-order logic with equality (under certain conditions)
search strategies for clause selection
support for automated proof generation
support for equality reasoning
term ordering mechanisms
fullName SPASS automated theorem prover NERFINISHED
goal automate reasoning in first-order logic with equality
hasProperty can be integrated into verification toolchains
can be used as a backend prover
implements advanced search strategies
implements redundancy elimination techniques
implements simplification techniques for clauses
supports equality reasoning via superposition
inferenceRule equality reasoning rules
resolution
superposition
logicType first-order logic
method equational reasoning
resolution-style inference
term rewriting
output diagnostic information about proof search
formal refutations
proof objects
relatedTo automated deduction
formal methods
model checking (via integration in workflows)
other superposition-based provers
supports first-order clause logic
supportsTask model generation (limited)
proof search
satisfiability checking in first-order logic
theorem proving
usedFor benchmarking of theorem proving techniques
research in automated deduction
verification of communication protocols
verification of hardware systems
verification of security properties
verification of software systems
uses superposition calculus

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Vampire automated theorem prover relatedTo SPASS automated theorem prover