Unit read-once refutations for systems of difference constraints
From MaRDI portal
Cites work
- A combinatorial algorithm for Horn programs
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- A Machine-Oriented Logic Based on the Resolution Principle
- A new approach to dynamic all pairs shortest paths
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Analyzing unit read-once refutations in difference constraint systems
- Color-coding
- Computer Aided Verification
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1223618 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 751135 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 7650340 (Why is no real title available?)
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- Introduction to algorithms.
- On the complexity of approximating the independent set problem
- Optimal length resolution refutations of difference constraint systems
- Parameterized algorithms
- Parametric dispatching of hard real-time tasks
- Restricted cutting plane proofs in Horn constraint systems
- The Complexity of Propositional Proofs
- The intractability of resolution
This page was built for publication: Unit read-once refutations for systems of difference constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174656)
