no code implementations • 22 Apr 2013 • Andreas Pfandler, Stefan Rümmele, Stefan Szeider
This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT).
no code implementations • 25 Apr 2014 • Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
This paper presents a general approach to define new merging operators derived from existing ones such that the result of merging remains in the fragment under consideration.
