no code implementations • 12 Mar 2023 • Eduardo Calò, Jordi Levy
First, using brute force, generating all possible formulae in increasing size and checking if they are equivalent to the original formula by testing all possible variable assignments.
no code implementations • 4 Apr 2022 • Carlos Ansótegui, Jordi Levy
Representing some problems with XOR clauses (parity constraints) can allow to apply more efficient reasoning techniques.
no code implementations • 16 Feb 2021 • Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus Kutz
We also provide a nominal unification algorithm for higher-order expressions with recursive let and atom-variables, where we show that it also runs in nondeterministic polynomial time.
no code implementations • 10 Jun 2016 • Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon
The research community on complex networks has developed techniques of analysis and algorithms to study real-world graphs that can be used by the SAT community.
