Journal of Automated Reasoning
Soft Typing for Ordered Resolution
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Inductive Theorem Proving by Consistency for First-Order Clauses
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Combining superposition, sorts and splitting
Handbook of automated reasoning
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Decidability Results for Saturation-Based Model Building
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Evaluation of automated theorem proving on the Mizar mathematical library
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Superposition-based analysis of first-order probabilistic timed automata
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The TPTP world - infrastructure for automated reasoning
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Disunification for ultimately periodic interpretations
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Modal Access Control LogicAxiomatization, Semantics and FOL Theorem Proving
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
The RNA Ontology (RNAO): An ontology for integrating RNA sequence and structure data
Applied Ontology - Biomedical Ontologies
Dynamics in delegation and revocation schemes: a logical approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Experimenting with deduction modulo
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Heaps and data structures: a challenge for automated provers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automated verification of virtualized infrastructures
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Superposition modulo non-linear arithmetic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Overview and evaluation of premise selection techniques for large theory mathematics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Relational abstract interpretation for the verification of 2-hypersafety properties
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
CADE'13 Proceedings of the 24th international conference on Automated Deduction
A proof procedure for hybrid logic with binders, transitivity and relation hierarchies
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Computing tiny clause normal forms
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Superposition for bounded domains
Automated Reasoning and Mathematics
Theorem proving in large formal mathematics as an emerging AI field
Automated Reasoning and Mathematics
Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
Journal of Automated Reasoning
| Hi-index | 0.00 |
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in SPASS 3.5 including subterm contextual rewriting, improved split backtracking, a significantly faster FLOTTER implementation with additional control flags, completely symmetric implementation of forward and backward redundancy criteria, faster parsing with improved support for big files, faster and extended sort module, and support for include commands in input files. Finally, SPASS 3.5 can now parse files in TPTP syntax, comes with a new converter tptp2dfg and is distributed under a BSD style license.