Unit read-once refutations for systems of difference constraints
From MaRDI portal
Publication:6174656
DOI10.1007/s00224-023-10134-yMaRDI QIDQ6174656
No author found.
Publication date: 17 August 2023
Published in: Theory of Computing Systems (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- Optimal length resolution refutations of difference constraint systems
- The intractability of resolution
- On the complexity of approximating the independent set problem
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- Analyzing unit read-once refutations in difference constraint systems
- Restricted cutting plane proofs in Horn constraint systems
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- A combinatorial algorithm for Horn programs
- Color-coding
- Parametric dispatching of hard real-time tasks
- The Complexity of Propositional Proofs
- A new approach to dynamic all pairs shortest paths
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Parameterized Algorithms
- A Machine-Oriented Logic Based on the Resolution Principle
- Computer Aided Verification
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
This page was built for publication: Unit read-once refutations for systems of difference constraints