Formal verification of a combination decision procedure
From MaRDI portal
Recommendations
Cited in
(16)- Empirical analysis of algorithms for the shortest negative cost cycle problem
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
- Analyzing fractional Horn constraint systems
- Tree-like unit refutations in Horn constraint systems
- Feasibility checking in Horn constraint systems through a reduction based approach
- SMT proof checking using a logical framework
- A combinatorial algorithm for Horn programs
- Deciding Combinations of Theories
- A generalization of Shostak's method for combining decision procedures
- Verifying integrity of decision diagrams
- Little engines of proof
- Automated Deduction – CADE-20
- Unit refutations in Horn constraint systems
- Unit refutability of Horn constraint systems -- certification and parallel complexity
- Optimal length resolution refutations of difference constraint systems
This page was built for publication: Formal verification of a combination decision procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809071)
