2 citations · 2 across the 3 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2017
ENIGMA: Efficient Learning-based Inference Guiding Machine
Jan Jakubův, Josef Urban
ENIGMA is a learning-based method for guiding given clause selection in saturation-based theorem provers. Clauses from many proof searches are classified as positive and negative b…
cs.LO2016
BliStrTune: Hierarchical Invention of Theorem Proving Strategies
Jan Jakubuv, Josef Urban
Inventing targeted proof search strategies for specific problem sets is a difficult task. State-of-the-art automated theorem provers (ATPs) such as E allow a large number of user-s…
cs.LO2010★ 2 cited
Expressiveness of Generic Process Shape Types
Jan Jakubuv, J. B. Wells
Shape types are a general concept of process types which work for many process calculi. We extend the previously published Poly* system of shape types to support name restriction.…