8 citations · 13 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021★ 1 cited
A Curiously Effective Backtracking Strategy for Connection Tableaux
Michael Färber
Automated proof search with connection tableaux, such as implemented by Otten's leanCoP prover, depends on backtracking for completeness. Otten's restricted backtracking strategy l…
cs.LO2021
Safe, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting
Michael Färber
Several proof assistants, such as Isabelle or Coq, can concurrently check multiple proofs. In contrast, the vast majority of today's small proof checkers either does not support co…