Unit read-once refutations for systems of difference constraints

DOI10.1007/S00224-023-10134-YMaRDI QIDQ6174656FDOQ6174656

Authors:

Publication date: 17 August 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Introduction to algorithms.
• Color-coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new approach to dynamic all pairs shortest paths
• Parameterized Algorithms
• Title not available (Why is that?)
• A Machine-Oriented Logic Based on the Resolution Principle
• The Complexity of Propositional Proofs
• Computer Aided Verification
• On the complexity of approximating the independent set problem
• Title not available (Why is that?)
• Fast and Flexible Difference Constraint Propagation for DPLL(T)
• The intractability of resolution
• Title not available (Why is that?)
• Parametric dispatching of hard real-time tasks
• A combinatorial algorithm for Horn programs
• A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
• Improved algorithms for optimal length resolution refutation in difference constraint systems
• Optimal length resolution refutations of difference constraint systems
• Restricted cutting plane proofs in Horn constraint systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• Analyzing unit read-once refutations in difference constraint systems
• Title not available (Why is that?)

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)