3 citations · 6 across the 7 of their papers we have counts for
3 papers · 1 filter
Finding Connections via Satisfiability Solving
Clemens Eisenhofer, Michael Rawson, Laura Kovács
Commonly used proof strategies by automated reasoners organise proof search either by ordering-based saturation or by reducing goals to subgoals. In this paper, we combine these tw…
On Solving String Equations via Powers and Parikh Images
Clemens Eisenhofer, Theodor Seiser, Nikolaj S. Bjørner +1
We present a new approach for solving string equations as extensions of Nielsen transformations. Key to our work are the combination of three techniques: a power operator for strin…
Constraint Learning for Non-confluent Proof Search
Michael Rawson, Clemens Eisenhofer, Laura Kovács
Proof search in non-confluent tableau calculi, such as the connection tableau calculus, suffers from excess backtracking, but simple restrictions on backtracking are incomplete. We…