29 citations · 64 across the 9 of their papers we have counts for
4 papers · 1 filter
SAT-IT: an Online Interactive SAT Tracer
Wilber Bermeo, Jordi Coll, Pau Ferrer +1
Modern Boolean Satisfiability (SAT) solvers, based on the Conflict-Driven Clause Learning (CDCL) paradigm, achieve state-of-the-art efficiency but present a steep learning curve du…
Nominal anti-unification
Alexander Baumgartner, Temur Kutsia, Jordi Levy +1
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general…
Nominal Unification and Matching of Higher Order Expressions with Recursive Let
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy +2
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in nondeterministic polynomial time. We also…
Nominal Unification from a Higher-Order Perspective
Jordi Levy, Mateu Villaret
Nominal Logic is a version of first-order logic with equality, name-binding, renaming via name-swapping and freshness of names. Contrarily to higher-order logic, bindable names, ca…