Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
Automated reasoning (2nd ed.): introduction and applications
Automated reasoning (2nd ed.): introduction and applications
Robbins algebra: conditions that make a near-boolean algebra boolean
Journal of Automated Reasoning
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
33 basic test problems: a practical evaluation of some paramodulation strategies
Automated reasoning and its applications
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Basic Paramodulation and Superposition
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Programs that offer fast, flawless, logical reasoning
Communications of the ACM
Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Introduction to logic-based artificial intelligence
Logic-based artificial intelligence
Adaptation of declaratively represented methods in proof planning
Annals of Mathematics and Artificial Intelligence
A model and a first analysis of distributed-search contraction-based strategies
Annals of Mathematics and Artificial Intelligence
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
Compute-intensive methods in artificial intelligence
Annals of Mathematics and Artificial Intelligence
Journal of Automated Reasoning
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning
General Algorithms for Permutations in Equational Inference
Journal of Automated Reasoning
Single Elementary Associative-Commutative Matching
Journal of Automated Reasoning
A Milestone Reached and a Secret Revealed
Journal of Automated Reasoning
Journal of Automated Reasoning
Short Single Axioms for Boolean Algebra
Journal of Automated Reasoning
Alan W. Biermann, Great Ideas in Computer Science: A Gentle Introduction
Minds and Machines
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
Analysis of Distributed-Search Contraction-Based Strategies
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Automating the Search for Answers to Open Questions
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
In Search of a Phase Transition in the AC-Matching Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Learning Search Control Knowledge for Equational Theorem Proving
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Presenting Proofs in a Human-Oriented Way
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Invited Talk: Rewrite-based Deduction and Symbolic Constraints
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Journal of Automated Reasoning
Logical methods for computational intelligence
The Knowledge Engineering Review
MPTP -- Motivation, Implementation, First Experiments
Journal of Automated Reasoning
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Computational Discovery in Pure Mathematics
Computational Discovery of Scientific Knowledge
Theorem Proving for Verification (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
On Automating the Calculus of Relations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
ACM SIGACT News
A Foundational Architecture for Artificial General Intelligence
Proceedings of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006
Automated deduction for verification
ACM Computing Surveys (CSUR)
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automated Inference of Finite Unsatisfiability
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automated reasoning: past story and new trends
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Special issue on practical aspects of automated reasoning
AI Communications - Practical Aspects of Automated Reasoning
Automated theorem proving in quasigroup and loop theory
AI Communications - Practical Aspects of Automated Reasoning
Linear groupoids and the associated wreath products
Journal of Symbolic Computation
Automated conjecture making in number theory using HR, Otter and Maple
Journal of Symbolic Computation
Applications of automated reasoning
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A short survey of automated reasoning
AB'07 Proceedings of the 2nd international conference on Algebraic biology
A taxonomy of theorem-proving strategies
Artificial intelligence today
A survey of automated deduction
Artificial intelligence today
Automated reasoning and presentation support for formalizing mathematics in Mizar
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Proofs, proofs, proofs, and proofs
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Automated proof compression by invention of new definitions
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Automated Inference of Finite Unsatisfiability
Journal of Automated Reasoning
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automated and human proofs in general mathematics: an initial comparison
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Basic Completion with E-cycle Simplification
Fundamenta Informaticae
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
The legacy of a great researcher
Automated Reasoning and Mathematics
The strategy challenge in SMT solving
Automated Reasoning and Mathematics
MACE4 and SEM: a comparison of finite model generators
Automated Reasoning and Mathematics
Communications of the ACM
Hi-index | 0.03 |
In this article we show that the three equations known as commutativity,associativity, and the Robbins equation are a basis for the variety ofBoolean algebras. The problem was posed by Herbert Robbins in the 1930s. Theproof was found automatically by EQP, a theorem-proving program forequational logic. We present the proof and the search strategies thatenabled the program to find the proof.