Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Term rewriting and all that
WALDMEISTER - High-Performance Equational Deduction
Journal of Automated Reasoning
DISCOUNT: A SYstem for Distributed Equational Deduction
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: Spass Version 1.0.0
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Semantic Selection for Resolution in Clause Graphs
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Towards Semantic Goal-Directed Forward Reasoning in Resolution
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Adaptive Saturation-Based Reasoning
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Limited resource strategy in resolution theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
ACM Transactions on Computational Logic (TOCL)
Web ontology segmentation: analysis, classification and use
Proceedings of the 15th international conference on World Wide Web
Testing, abstraction, theorem proving: better together!
Proceedings of the 2006 international symposium on Software testing and analysis
Automation for interactive proof: first prototype
Information and Computation - Special issue: Combining logical systems
AI Communications - CASC
Alternating two-way AC-tree automata
Information and Computation
Automatic Construction and Verification of Isotopy Invariants
Journal of Automated Reasoning
Efficient E-Matching for SMT Solvers
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Web Ontology Segmentation: Extraction, Transformation, Evaluation
Modular Ontologies
Reasoning about partially observed actions
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
KRRT: knowledge representation and reasoning tutor system
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Resolution with Order and Selection for Hybrid Logics
Journal of Automated Reasoning
Automated reasoning support for first-order ontologies
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Zap: automated theorem proving for software analysis
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automatic construction and verification of isotopy invariants
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Combining type theory and untyped set theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Implementing temporal logics: tools for execution and proof
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
In this abstract we describe version 1.1 of the theorem prover Vampire. We give a general description and comment on Vampire's original features and differences with the previously described version 0.0.From the very beginning, the main research principle of Vampire was efficiency. Vampire uses a large number of data structures for indexing terms and clauses. Efficiency is still the most distinctive feature of Vampire. Due to reimplementation of some algorithms and data structures, Vampire 1.1 is on the average considerably more efficient than Vampire 0.0.However, the last year many efforts were invested in flexibility: several new inference and simplification rules were implemented, options for controlling the proof search process added, and new literal selection schemes designed.For the remaining time before IJCAR 2001, we are going to concentrate on adding more flexibility to Vampire, both for experienced and inexperienced users.