no code implementations • 30 Dec 2019 • Giles Reger
This changes the landscape on which we perform our research: solving problems that can already be solved may not improve the state of the art and a method that can solve a handful of problems unsolvable by current methods, but generally performs poorly on most problems, can be very useful.
no code implementations • 27 Apr 2016 • Giles Reger, Martin Suda, Andrei Voronkov, Krystof Hoder
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for reasoning about first-order logic with or without equality.
