Analyzing unit read-once refutations in difference constraint systems

DOI10.1007/978-3-030-75775-5_11OpenAlexW3160619214MaRDI QIDQ2055789

K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_11

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (1)

Unit read-once refutations for systems of difference constraints

Cites Work

• Optimal length resolution refutations of difference constraint systems
• The intractability of resolution
• Improved algorithms for optimal length resolution refutation in difference constraint systems
• Read-once resolutions in Horn formulas
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• 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)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing unit read-once refutations in difference constraint systems