Ordered rewriting and confluence
CADE-10 Proceedings of the tenth international conference on Automated deduction
Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Term Indexing
Canonical Equational Proofs
Basic Superposition is Complete
ESOP '92 Proceedings of the 4th European Symposium on Programming
Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Basic Paramodulation and Superposition
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Learning Domain Knowledge to Improve Theorem Proving
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
On the Evaluation of Indexing Techniques for Theorem Proving
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CCE: Testing Ground Joinability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decision Problems in Ordered Rewriting
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On using ground joinable equations in equational theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
Efficient instance retrieval with standard and relational path indexing
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Knuth-Bendix completion of theories of commuting group endomorphisms
Information Processing Letters
Things to Know when Implementing KBO
Journal of Automated Reasoning
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
Efficient instance retrieval with standard and relational path indexing
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Knuth--Bendix completion of theories of commuting group endomorphisms
Information Processing Letters
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Machine learning approach to enhance the design of automated theorem provers
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
First-Order theorem proving and vampire
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Simple and efficient clause subsumption with feature vector indexing
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
The architecture of the WALDMEISTER prover for unit equational deduction is based on a strict separation of active and passive facts. After an inspection of the system's proof procedure, the representation of each of the central data structures is outlined, namely indexing for the active facts, compression for the passive facts, successor sets for the hypotheses, and minimal recording of inference steps for the proof object. In order to cope with large search spaces, specialized redundancy criteria are employed, and the empirically gained control knowledge is integrated to ease the use of the system. The paper concludes with a quantitative comparison of the WALDMEISTER versions over the years, and a view of the future prospects.