On the copy complexity of width 3 Horn constraint systems

DOI10.1007/978-3-030-86205-3_4MaRDI QIDQ831922zbMATH OpenOpenAlexFDO

Authors Alvaro Velasquez, K. Subramani, Piotr Wojciechowski

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-86205-3_4

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Combining forward and backward abstract interpretation of Horn clauses
• Horn clause solvers for program verification
• On the complexity of \(k\)-SAT
• Restricted cutting plane proofs in Horn constraint systems
• Which problems have strongly exponential complexity?

Cited in

(2)

• Copy complexity of Horn formulas with respect to unit read-once resolution
• Farkas Bounds on Horn Constraint Systems

This page was built for publication: On the copy complexity of width 3 Horn constraint systems

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