On the copy complexity of width 3 Horn constraint systems

DOI10.1007/978-3-030-86205-3_4OpenAlexW3198816844MaRDI QIDQ831922

Alvaro Velasquez, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Which problems have strongly exponential complexity?
• Restricted cutting plane proofs in Horn constraint systems
• Horn Clause Solvers for Program Verification
• Combining Forward and Backward Abstract Interpretation of Horn Clauses
• On the complexity of \(k\)-SAT

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