Proving Unsatisfiability with Hitting Formulas

Hitting formulas have been studied in many different contexts at least since [Iwama,89]. A hitting formula is a set of Boolean clauses such that any two of them cannot be simultaneously falsified. [Peitl,Szeider,05] conjectured that hitting formulas should contain the hardest formulas for resolution...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Filmus, Yuval, Hirsch, Edward A, Riazanov, Artur, Smal, Alexander, Vinyals, Marc
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Mathematics - Logic
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!