Read-once refutations in Horn constraint systems: an algorithmic approach

DOI10.1093/LOGCOM/EXAB072OpenAlexW4205697168MaRDI QIDQ5866468FDOQ5866468

Authors: Ying Sheng, K. Subramani, Piotr Wojciechowski 

Publication date: 22 September 2022

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exab072

Recommendations

• Exact and parameterized algorithms for read-once refutations in Horn constraint systems
• Analyzing read-once cutting plane proofs in Horn systems
• On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
• Restricted cutting plane proofs in Horn constraint systems
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cited In (3)

• Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Read-once refutations in Horn constraint systems: an algorithmic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866468)