SPASS - Version 0.49

Authors:
Christoph Weidenbach
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany. e-mail: weidenb@mpi-sb.mpg.de
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 4
Cited 17

Theorem proving with ordering and equality constrained clauses

Journal of Symbolic Computation
Basic paramodulation

Information and Computation
Unification in Pseudo-Linear Sort Theories is Decidable

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction

Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
The CADE-14 ATP System Competition

Journal of Automated Reasoning
The CADE-15 ATP System Competition

Journal of Automated Reasoning
On the Completeness of Arbitrary Selection Strategies for Paramodulation

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Invited Talk: Rewrite-based Deduction and Symbolic Constraints

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Context Trees

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Fast Term Indexing with Coded Context Trees

Journal of Automated Reasoning
Octopus: Combining Learning and Parallel Search

Journal of Automated Reasoning
Proof planning with multiple strategies

Artificial Intelligence
Automatic Decidability and Combinability Revisited

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
SMELS: Satisfiability Modulo Equality with Lazy Superposition

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
A Formal Descriptive Semantics of UML

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Applications of automated reasoning

KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
The space efficiency of OSHL

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Case Splitting in an Automatic Theorem Prover for Real-Valued Special Functions

Journal of Automated Reasoning
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article describes SPASS, Version 0.49, as it was entered in the system competition at CADE-13. SPASS is an automated theorem prover for full first-order logic with equality. It is based on the superposition calculus originally developed by Bachmair and Ganzinger, extended by the sort techniques due to Weidenbach and an inference rule for case analysis.