Tree-like unit refutations in Horn constraint systems
From MaRDI portal
Publication:2232285
DOI10.1007/978-3-030-68195-1_18OpenAlexW3129261105MaRDI QIDQ2232285
K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 4 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-68195-1_18
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some consequences of non-uniform conditions on uniform classes
- Optimal length resolution refutations of difference constraint systems
- Linear and unit-resulting refutations for Horn theories
- Tree-like unit refutations in Horn constraint systems
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- A combinatorial algorithm for Horn programs
- Refutation search for Horn sets by a subgoal-extraction method
- Kernelization
- Automated Reasoning
This page was built for publication: Tree-like unit refutations in Horn constraint systems
