Solution of the Robbins problem
From MaRDI portal
Recommendations
Cited in
(56)- The legacy of a great researcher
- Relaxed weighted path order in theorem proving
- Additive number theory via automata theory
- The application of automated reasoning to formal models of combinatorial optimization
- Building Theorem Provers
- scientific article; zbMATH DE number 1446773 (Why is no real title available?)
- Larry Wos: visions of automated reasoning
- The resonance strategy
- Basis reduction for cryptogroups and orthogroups
- On computer-assisted proving the existence of periodic and bounded orbits
- Experimental mathematics, computers and the a priori
- Mechanizing complemented lattices within Mizar type system
- Using the prover ANDP to simplify orthogonality.
- Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors
- Linear groupoids and the associated wreath products.
- Harald Ganzinger's legacy: contributions to logics and programming
- Deduction as an engineering science
- Robbins algebras vs. Boolean algebras
- Automated Inference of Finite Unsatisfiability
- Automated inference of finite unsatisfiability
- The strategy challenge in SMT solving
- On a Problem of Robbins
- From informal to formal proofs in Euclidean geometry
- Filtering unification and most general unifiers in modal logic
- Computer supported mathematics with MEGA
- A method for finding new sets of axioms for classes of semigroups.
- Superposition-based equality handling for analytic tableaux
- Single axioms for groups
- The clause-diffusion theorem prover Peers-mcd (system description)
- 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.
- Automated conjecturing. III. Property-relations conjectures
- MACE4 and SEM: a comparison of finite model generators
- Computational logic: its origins and applications
- On Automating the Calculus of Relations
- An introduction to mechanized reasoning
- Checking proofs
- Ken Kunen: algebraist.
- Theorem proving modulo
- Automated deduction in ring theory
- Certified equational reasoning via ordered completion
- Computer-aided proof of Erdős discrepancy properties
- One step further : an explicit solution to Robbins’ problem when n = 4
- 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
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)
