Exact and parameterized algorithms for read-once refutations in Horn constraint systems

DOI10.1007/978-3-030-93100-1_21OpenAlexW4200456662MaRDI QIDQ2151419

K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93100-1_21

Mathematics Subject Classification ID

Logic in computer science (03B70)

Uses Software

• Yices

Cites Work

• Unnamed Item
• Unnamed Item
• Discrete mathematics
• Some consequences of non-uniform conditions on uniform classes
• Optimal length resolution refutations of difference constraint systems
• The intractability of resolution
• A new strongly polynomial dual network simplex algorithm
• Restricted cutting plane proofs in Horn constraint systems
• Read-once resolutions in Horn formulas
• Feasibility checking in Horn constraint systems through a reduction based approach
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• A combinatorial algorithm for Horn programs
• Horn Clause Solvers for Program Verification
• Kernelization
• Automated Reasoning

This page was built for publication: Exact and parameterized algorithms for read-once refutations in Horn constraint systems