29 citations · 78 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.PL2016★ 17 cited
Nominal Unification of Higher Order Expressions with Recursive Let
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy +1
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also…
cs.AI2016★ 6 cited
Community Structure in Industrial SAT Instances
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru +2
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is…