Improved algorithms for optimal length resolution refutation in difference constraint systems - researchr publication related

researchr

You are not signed in
Sign in
Sign up

K. Subramani, Matthew Williamson, Xiaofeng Gu. Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Asp. Comput., 25(2):319-341, 2013. [doi]

The following publications are possibly variants of this publication:

Optimal Length Resolution Refutations of Difference Constraint SystemsK. Subramani. JAR, 43(2):121-137, 2009. [doi]

Unit Refutations of Difference Constraint SystemsK. Subramani, Piotr Wojciechowski 0001. ecai 2023: 2226-2233 [doi]

Unit Read-once Refutations for Systems of Difference ConstraintsK. Subramani, Piotr Wojciechowski 0002. mst, 67(4):877-899, August 2023. [doi]

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraintsPiotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. DAM, 305:272-294, 2021. [doi]

Optimal length tree-like resolution refutations for 2SAT formulasK. Subramani. tocl, 5(2):316-320, 2004. [doi]

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI ConstraintsPiotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. faw 2018: 300-314 [doi]

runs on WebDSL