most citedSAT Solving Using XOR-OR-AND Normal Forms

4 citations · 4 across the 2 of their papers we have counts for

collaborators

2 papers

math.AC2024

Efficiently Checking Separating Indeterminates

Bernhard Andraschko, Martin Kreuzer, Le Ngoc Long

In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called -separating re-embeddings. Given an ideal …

cs.LO2023★ 4 cited

SAT Solving Using XOR-OR-AND Normal Forms

Bernhard Andraschko, Julian Danner, Martin Kreuzer

This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by X…