Read-once resolutions in Horn formulas

DOI10.1007/978-3-030-18126-0_9OpenAlexW2935683702MaRDI QIDQ2327091

Hans Kleine Büning, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-18126-0_9

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

Exact and parameterized algorithms for read-once refutations in Horn constraint systems ⋮ Analyzing read-once cutting plane proofs in Horn systems ⋮ Copy complexity of Horn formulas with respect to unit read-once resolution ⋮ Analyzing unit read-once refutations in difference constraint systems ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas

This page was built for publication: Read-once resolutions in Horn formulas