Solution of the Robbins problem
DOI10.1023/A:1005843212881zbMATH Open0883.06011OpenAlexW1510333080WikidataQ64225930 ScholiaQ64225930MaRDI QIDQ1373299FDOQ1373299
Authors: William McCune 
Publication date: 23 March 1998
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005843212881
Recommendations
commutativityassociativityparamodulationRobbins algebrasearch strategiesvariety of Boolean algebrasRobbins equationassociative-commutative unificationEQPtheorem-proving program for equational logic
Structure theory of Boolean algebras (06E05) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Cited In (56)
- The clause-diffusion theorem prover Peers-mcd (system description)
- One step further : an explicit solution to Robbins’ problem when n = 4
- Building Theorem Provers
- Relaxed weighted path order in theorem proving
- Additive number theory via automata theory
- The application of automated reasoning to formal models of combinatorial optimization
- Title not available (Why is that?)
- Larry Wos: visions of automated reasoning
- On computer-assisted proving the existence of periodic and bounded orbits
- Basis reduction for cryptogroups and orthogroups
- The resonance strategy
- Experimental mathematics, computers and the a priori
- Mechanizing complemented lattices within Mizar type system
- Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors
- Harald Ganzinger's legacy: contributions to logics and programming
- Deduction as an engineering science
- Using the prover ANDP to simplify orthogonality.
- Linear groupoids and the associated wreath products.
- Automated Inference of Finite Unsatisfiability
- Robbins algebras vs. Boolean algebras
- The strategy challenge in SMT solving
- Automated inference of finite unsatisfiability
- On a Problem of Robbins
- Filtering unification and most general unifiers in modal logic
- From informal to formal proofs in Euclidean geometry
- Computer supported mathematics with \(\Omega\)MEGA
- A method for finding new sets of axioms for classes of semigroups.
- Superposition-based equality handling for analytic tableaux
- Single axioms for groups
- On the modelling of search in theorem proving -- towards a theory of strategy analysis
- Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem
- Evaluating general purpose automated theorem proving systems
- Knowledge-based proof planning
- Simplifying von Plato's axiomatization of constructive apartness geometry
- Problem corner: Robbins algebra: Conditions that make a near-Boolean algebra Boolean
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Absorption and idempotency criteria for a problem in near-Boolean algebras
- Complete axiomatizations for XPath fragments
- MPTP-motivation, implementation, first experiments
- Computer solutions of problems in inverse semigroups.
- MACE4 and SEM: a comparison of finite model generators
- Automated conjecturing. III. Property-relations conjectures
- Computational logic: its origins and applications
- On Automating the Calculus of Relations
- Checking proofs
- An introduction to mechanized reasoning
- Ken Kunen: algebraist.
- Automated deduction in ring theory
- Theorem proving modulo
- Certified equational reasoning via ordered completion
- Computer-aided proof of Erdős discrepancy properties
- Goals and benchmarks for automated map reasoning
- Automated conjecture making in number theory using HR, Otter and Maple
- Proof verification technology and elementary physics
- Well-behaved search and the Robbins problem
- The legacy of a great researcher
This page was built for publication: Solution of the Robbins problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373299)
