Open AccessJournal Article
E - a brainiac theorem prover
TLDR
E is a sound and complete prover for clausal first order logic with equality and has a very flexible interface for specifying search control heuristics, and an efficient inference engine.Abstract:
We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality. Important properties of the prover include strong redundancy elimination criteria, the DISCOUNT loop proof procedure, a very flexible interface for specifying search control heuristics, and an efficient inference engine. We also discuss strength and weaknesses of the system.read more
Citations
More filters
Journal ArticleDOI
The TPTP Problem Library and Associated Infrastructure
TL;DR: This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the TPTP problem library, and the associated infrastructure.
Book ChapterDOI
First-Order Theorem Proving and Vampire
Laura Kovács,Andrei Voronkov +1 more
TL;DR: The superposition calculus is discussed and the key concepts of saturation and redundancy elimination are explained, present saturation algorithms and preprocessing, and demonstrate how these concepts are implemented in Vampire.
Proceedings ArticleDOI
Full functional verification of linked data structures
TL;DR: The Jahob verification system is used to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data structure implementations (with the exception of properties involving execution time and/or memory consumption).
Journal ArticleDOI
Lazy Satisfiability Modulo Theories
TL;DR: An extensive survey of SMT, with particular focus on the lazy approach, survey, classify and analyze from a theory-independent perspective the most effective techniques and optimizations which are of interest for lazy SMT and which have been proposed in various communities.
Book ChapterDOI
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
TL;DR: The design of iProver is discussed, which is an instantiation-based theorem prover based on Inst-Gen calculus, complete for first-order logic, and a combination of instantiation and ordered resolution.
References
More filters
Journal ArticleDOI
A Machine-Oriented Logic Based on the Resolution Principle
TL;DR: The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
Book
Term rewriting and all that
Franz Baader,Tobias Nipkow +1 more
TL;DR: This chapter discusses abstract reduction systems, universal algebra, and Grobner bases and Buchberger's algorithm, and a bluffer's guide to ML Bibliography Index.
Book ChapterDOI
Simple Word Problems in Universal Algebras
Donald E. Knuth,Peter B. Bendix +1 more
TL;DR: In this article, an algorithm is described which is capable of solving certain word problems: i.e., deciding whether or not two words composed of variables and operators can be proved equal as a consequence of a given set of identities satisfied by the operators.
Journal ArticleDOI
Self-adjusting binary search trees
TL;DR: The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
Journal ArticleDOI
Rewrite-based Equational Theorem Proving with Selection and Simplification
Leo Bachmair,Harald Ganzinger +1 more
TL;DR: This paper forms an abstract notion of redundancy and shows that the deletion of redundant clauses during the theorem proving process preserves refutation completeness, and presents various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses.