Analyzing read-once cutting plane proofs in Horn systems
From MaRDI portal
Publication:2673307
DOI10.1007/s10817-022-09618-2OpenAlexW4214507692WikidataQ113901235 ScholiaQ113901235MaRDI QIDQ2673307
R. Chandrasekaran, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 9 June 2022
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-022-09618-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certifying algorithms
- On finding short resolution refutations and small unsatisfiable subsets
- Optimal length resolution refutations of difference constraint systems
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- The intractability of resolution
- On the complexity of approximating the independent set problem
- The complexity of read-once resolution
- What is answer set programming to propositional satisfiability
- Finding read-once resolution refutations in systems of 2CNF clauses
- PRIMES is in P
- 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 framework for the verification of certifying computations
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- A combinatorial algorithm for Horn programs
- On unit read-once resolutions and copy complexity
- Horn Clause Solvers for Program Verification
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Input Proofs and Rank One Cutting Planes
- Reducibility among Combinatorial Problems
- Combining Forward and Backward Abstract Interpretation of Horn Clauses
- Theory and Applications of Satisfiability Testing
- Parameterized Algorithms
This page was built for publication: Analyzing read-once cutting plane proofs in Horn systems
