Unit refutations in Horn constraint systems

DOI10.1007/978-3-031-92932-8_2MaRDI QIDQ6902212zbMATH OpenFDO

Authors Piotr Wojciechowski, K. Subramani

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_2

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Automated Reasoning
• Frontiers of Combining Systems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1319354 (Why is no real title available?)
• scientific article; zbMATH DE number 2090312 (Why is no real title available?)
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
• Refutation search for Horn sets by a subgoal-extraction method
• The complexity of read-once resolution
• The intractability of resolution
• Theorie der einfachen Ungleichungen.
• Two variables per linear inequality as an abstract domain

Cited in

(1)

• Unit refutability of Horn constraint systems -- certification and parallel complexity

This page was built for publication: Unit refutations in Horn constraint systems

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